/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 15:12:50,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 15:12:50,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 15:12:50,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 15:12:50,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 15:12:50,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 15:12:50,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 15:12:50,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 15:12:50,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 15:12:50,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 15:12:50,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 15:12:50,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 15:12:50,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 15:12:50,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 15:12:50,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 15:12:50,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 15:12:50,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 15:12:50,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 15:12:50,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 15:12:50,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 15:12:50,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 15:12:50,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 15:12:50,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 15:12:50,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 15:12:50,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 15:12:50,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 15:12:50,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 15:12:50,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 15:12:50,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 15:12:50,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 15:12:50,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 15:12:50,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 15:12:50,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 15:12:50,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 15:12:50,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 15:12:50,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 15:12:50,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 15:12:50,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 15:12:50,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 15:12:50,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 15:12:50,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 15:12:50,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-11 15:12:50,968 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 15:12:50,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 15:12:50,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 15:12:50,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 15:12:50,970 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 15:12:50,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 15:12:50,970 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 15:12:50,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 15:12:50,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 15:12:50,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 15:12:50,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 15:12:50,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 15:12:50,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 15:12:50,972 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 15:12:50,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 15:12:50,972 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 15:12:50,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 15:12:50,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 15:12:50,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 15:12:50,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 15:12:50,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 15:12:50,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:12:50,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 15:12:50,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 15:12:50,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 15:12:50,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 15:12:50,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 15:12:50,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 15:12:50,975 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 15:12:50,975 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 15:12:51,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 15:12:51,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 15:12:51,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 15:12:51,300 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 15:12:51,302 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 15:12:51,303 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013-2.i [2020-10-11 15:12:51,372 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0836199/f3c68f67d932477282fbc35faf7593dd/FLAGa3b79259d [2020-10-11 15:12:51,928 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 15:12:51,929 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013-2.i [2020-10-11 15:12:51,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0836199/f3c68f67d932477282fbc35faf7593dd/FLAGa3b79259d [2020-10-11 15:12:52,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0836199/f3c68f67d932477282fbc35faf7593dd [2020-10-11 15:12:52,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 15:12:52,186 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 15:12:52,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 15:12:52,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 15:12:52,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 15:12:52,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630b2f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52, skipping insertion in model container [2020-10-11 15:12:52,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 15:12:52,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 15:12:52,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:12:52,737 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 15:12:52,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:12:52,882 INFO L208 MainTranslator]: Completed translation [2020-10-11 15:12:52,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52 WrapperNode [2020-10-11 15:12:52,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 15:12:52,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 15:12:52,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 15:12:52,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 15:12:52,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 15:12:52,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 15:12:52,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 15:12:52,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 15:12:52,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:53,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:53,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:53,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:53,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 15:12:53,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 15:12:53,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 15:12:53,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 15:12:53,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:12:53,097 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-10-11 15:12:53,098 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-10-11 15:12:53,098 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-10-11 15:12:53,098 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-10-11 15:12:53,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 15:12:53,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 15:12:53,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 15:12:53,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 15:12:53,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 15:12:53,103 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 15:12:53,378 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 15:12:53,378 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-11 15:12:53,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:12:53 BoogieIcfgContainer [2020-10-11 15:12:53,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 15:12:53,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 15:12:53,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 15:12:53,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 15:12:53,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:12:52" (1/3) ... [2020-10-11 15:12:53,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17142cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:12:53, skipping insertion in model container [2020-10-11 15:12:53,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (2/3) ... [2020-10-11 15:12:53,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17142cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:12:53, skipping insertion in model container [2020-10-11 15:12:53,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:12:53" (3/3) ... [2020-10-11 15:12:53,392 INFO L111 eAbstractionObserver]: Analyzing ICFG fkp2013-2.i [2020-10-11 15:12:53,414 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 15:12:53,417 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 15:12:53,431 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-11 15:12:53,435 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 15:12:53,468 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,468 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,468 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,469 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,469 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,470 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,470 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,470 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,471 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,478 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,479 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,479 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,480 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,480 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,486 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,505 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-11 15:12:53,527 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:12:53,528 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:12:53,528 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:12:53,528 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:12:53,528 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:12:53,528 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:12:53,529 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:12:53,529 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:12:53,543 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:12:53,546 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions, 112 flow [2020-10-11 15:12:53,549 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 51 transitions, 112 flow [2020-10-11 15:12:53,551 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 112 flow [2020-10-11 15:12:53,593 INFO L129 PetriNetUnfolder]: 3/61 cut-off events. [2020-10-11 15:12:53,593 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 15:12:53,599 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-10-11 15:12:53,602 INFO L117 LiptonReduction]: Number of co-enabled transitions 692 [2020-10-11 15:12:54,747 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-10-11 15:12:54,806 INFO L132 LiptonReduction]: Checked pairs total: 670 [2020-10-11 15:12:54,807 INFO L134 LiptonReduction]: Total number of compositions: 47 [2020-10-11 15:12:54,813 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-10-11 15:12:54,823 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-10-11 15:12:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-10-11 15:12:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:12:54,832 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:54,832 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:12:54,833 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:12:54,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash 208056, now seen corresponding path program 1 times [2020-10-11 15:12:54,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:54,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797689549] [2020-10-11 15:12:54,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:55,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797689549] [2020-10-11 15:12:55,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:55,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:12:55,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114207216] [2020-10-11 15:12:55,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:12:55,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:55,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:12:55,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:12:55,073 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-10-11 15:12:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:55,097 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-10-11 15:12:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:12:55,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:12:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:55,113 INFO L225 Difference]: With dead ends: 35 [2020-10-11 15:12:55,113 INFO L226 Difference]: Without dead ends: 31 [2020-10-11 15:12:55,115 INFO L673 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-10-11 15:12:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-11 15:12:55,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-11 15:12:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-11 15:12:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-10-11 15:12:55,152 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-10-11 15:12:55,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:55,153 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-10-11 15:12:55,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:12:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-10-11 15:12:55,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-11 15:12:55,154 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:55,154 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:55,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 15:12:55,155 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:12:55,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:55,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1139052385, now seen corresponding path program 1 times [2020-10-11 15:12:55,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:55,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809019197] [2020-10-11 15:12:55,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:55,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809019197] [2020-10-11 15:12:55,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:55,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:12:55,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666966020] [2020-10-11 15:12:55,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:12:55,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:55,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:12:55,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:12:55,279 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2020-10-11 15:12:55,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:55,302 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-10-11 15:12:55,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 15:12:55,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-10-11 15:12:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:55,304 INFO L225 Difference]: With dead ends: 26 [2020-10-11 15:12:55,304 INFO L226 Difference]: Without dead ends: 24 [2020-10-11 15:12:55,305 INFO L673 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-10-11 15:12:55,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-11 15:12:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-11 15:12:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-11 15:12:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-10-11 15:12:55,314 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-10-11 15:12:55,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:55,315 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-10-11 15:12:55,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:12:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-10-11 15:12:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-11 15:12:55,316 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:55,317 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:55,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 15:12:55,318 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:12:55,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:55,318 INFO L82 PathProgramCache]: Analyzing trace with hash -950894116, now seen corresponding path program 1 times [2020-10-11 15:12:55,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:55,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911975388] [2020-10-11 15:12:55,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:12:55,367 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:12:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:12:55,396 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:12:55,420 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:12:55,420 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:12:55,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 15:12:55,422 WARN L371 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-11 15:12:55,423 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-10-11 15:12:55,432 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,432 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,432 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,432 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,433 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,433 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,433 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,433 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,433 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,434 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,434 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,434 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,434 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,435 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,435 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,435 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,435 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,435 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,436 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,436 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,436 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,437 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,441 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,442 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,442 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,442 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,442 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,444 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,445 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,445 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,445 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,445 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,447 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,448 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,448 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,448 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,448 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,448 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,450 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,451 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,451 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,451 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,451 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,451 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,453 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-11 15:12:55,454 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:12:55,454 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:12:55,454 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:12:55,454 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:12:55,454 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:12:55,454 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:12:55,455 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:12:55,455 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:12:55,458 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:12:55,458 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions, 162 flow [2020-10-11 15:12:55,458 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 69 transitions, 162 flow [2020-10-11 15:12:55,458 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions, 162 flow [2020-10-11 15:12:55,479 INFO L129 PetriNetUnfolder]: 4/83 cut-off events. [2020-10-11 15:12:55,479 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-11 15:12:55,480 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-10-11 15:12:55,483 INFO L117 LiptonReduction]: Number of co-enabled transitions 1108 [2020-10-11 15:12:56,616 INFO L132 LiptonReduction]: Checked pairs total: 1240 [2020-10-11 15:12:56,616 INFO L134 LiptonReduction]: Total number of compositions: 62 [2020-10-11 15:12:56,616 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 21 transitions, 66 flow [2020-10-11 15:12:56,639 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2020-10-11 15:12:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2020-10-11 15:12:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:12:56,642 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:56,642 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:12:56,642 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:56,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:56,643 INFO L82 PathProgramCache]: Analyzing trace with hash 354555, now seen corresponding path program 1 times [2020-10-11 15:12:56,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:56,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665180235] [2020-10-11 15:12:56,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:56,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665180235] [2020-10-11 15:12:56,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:56,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:12:56,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332188306] [2020-10-11 15:12:56,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:12:56,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:56,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:12:56,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:12:56,671 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2020-10-11 15:12:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:56,697 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2020-10-11 15:12:56,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:12:56,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:12:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:56,703 INFO L225 Difference]: With dead ends: 185 [2020-10-11 15:12:56,703 INFO L226 Difference]: Without dead ends: 171 [2020-10-11 15:12:56,704 INFO L673 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-10-11 15:12:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-11 15:12:56,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-10-11 15:12:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-11 15:12:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 418 transitions. [2020-10-11 15:12:56,730 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 418 transitions. Word has length 3 [2020-10-11 15:12:56,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:56,731 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 418 transitions. [2020-10-11 15:12:56,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:12:56,731 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 418 transitions. [2020-10-11 15:12:56,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:12:56,732 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:56,732 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:56,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 15:12:56,732 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:56,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:56,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1106209149, now seen corresponding path program 1 times [2020-10-11 15:12:56,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:56,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644694838] [2020-10-11 15:12:56,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:56,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644694838] [2020-10-11 15:12:56,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:56,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:12:56,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065697435] [2020-10-11 15:12:56,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:12:56,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:56,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:12:56,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:12:56,802 INFO L87 Difference]: Start difference. First operand 171 states and 418 transitions. Second operand 5 states. [2020-10-11 15:12:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:56,855 INFO L93 Difference]: Finished difference Result 205 states and 460 transitions. [2020-10-11 15:12:56,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:12:56,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-11 15:12:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:56,858 INFO L225 Difference]: With dead ends: 205 [2020-10-11 15:12:56,859 INFO L226 Difference]: Without dead ends: 201 [2020-10-11 15:12:56,859 INFO L673 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-10-11 15:12:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-11 15:12:56,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2020-10-11 15:12:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-11 15:12:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2020-10-11 15:12:56,881 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2020-10-11 15:12:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:56,882 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2020-10-11 15:12:56,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:12:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2020-10-11 15:12:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:12:56,883 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:56,883 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:56,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 15:12:56,884 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:56,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:56,884 INFO L82 PathProgramCache]: Analyzing trace with hash 583411714, now seen corresponding path program 1 times [2020-10-11 15:12:56,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:56,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456104188] [2020-10-11 15:12:56,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:12:56,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456104188] [2020-10-11 15:12:56,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:56,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:12:56,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891701720] [2020-10-11 15:12:56,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:12:56,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:56,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:12:56,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:12:56,942 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2020-10-11 15:12:56,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:56,998 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2020-10-11 15:12:56,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:12:56,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:12:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:57,001 INFO L225 Difference]: With dead ends: 189 [2020-10-11 15:12:57,001 INFO L226 Difference]: Without dead ends: 185 [2020-10-11 15:12:57,002 INFO L673 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-10-11 15:12:57,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-11 15:12:57,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2020-10-11 15:12:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-11 15:12:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2020-10-11 15:12:57,019 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2020-10-11 15:12:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:57,020 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2020-10-11 15:12:57,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:12:57,020 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2020-10-11 15:12:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 15:12:57,022 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:57,022 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:57,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 15:12:57,022 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:57,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:57,023 INFO L82 PathProgramCache]: Analyzing trace with hash 903154619, now seen corresponding path program 1 times [2020-10-11 15:12:57,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:57,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088078265] [2020-10-11 15:12:57,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:12:57,037 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:12:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:12:57,048 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:12:57,054 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:12:57,055 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:12:57,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 15:12:57,056 WARN L371 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-11 15:12:57,060 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-10-11 15:12:57,085 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,086 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,086 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,086 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,086 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,086 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,087 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,087 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,087 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,087 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,088 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,088 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,088 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,089 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,089 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,089 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,090 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,090 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,090 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,091 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,091 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,091 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,091 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,091 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,092 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,092 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,092 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,103 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,103 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,103 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,103 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,107 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,112 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,112 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,113 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,113 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,113 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,117 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,117 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,117 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,117 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,118 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,119 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:57,128 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 15:12:57,128 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:12:57,128 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:12:57,128 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:12:57,128 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:12:57,128 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:12:57,129 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:12:57,129 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:12:57,129 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:12:57,133 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:12:57,133 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 87 transitions, 216 flow [2020-10-11 15:12:57,134 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 87 transitions, 216 flow [2020-10-11 15:12:57,134 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions, 216 flow [2020-10-11 15:12:57,169 INFO L129 PetriNetUnfolder]: 5/105 cut-off events. [2020-10-11 15:12:57,170 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-11 15:12:57,171 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-10-11 15:12:57,174 INFO L117 LiptonReduction]: Number of co-enabled transitions 1608 [2020-10-11 15:12:58,413 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-10-11 15:12:58,592 INFO L132 LiptonReduction]: Checked pairs total: 2157 [2020-10-11 15:12:58,592 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-11 15:12:58,593 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 27 transitions, 96 flow [2020-10-11 15:12:58,618 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2020-10-11 15:12:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2020-10-11 15:12:58,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:12:58,619 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:58,619 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:12:58,619 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:58,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:58,620 INFO L82 PathProgramCache]: Analyzing trace with hash 535749, now seen corresponding path program 1 times [2020-10-11 15:12:58,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:58,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607301069] [2020-10-11 15:12:58,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:58,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607301069] [2020-10-11 15:12:58,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:58,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:12:58,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430076960] [2020-10-11 15:12:58,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:12:58,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:58,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:12:58,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:12:58,645 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2020-10-11 15:12:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:58,683 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2020-10-11 15:12:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:12:58,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:12:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:58,691 INFO L225 Difference]: With dead ends: 600 [2020-10-11 15:12:58,692 INFO L226 Difference]: Without dead ends: 559 [2020-10-11 15:12:58,692 INFO L673 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-10-11 15:12:58,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-10-11 15:12:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2020-10-11 15:12:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-10-11 15:12:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1737 transitions. [2020-10-11 15:12:58,769 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1737 transitions. Word has length 3 [2020-10-11 15:12:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:58,770 INFO L481 AbstractCegarLoop]: Abstraction has 559 states and 1737 transitions. [2020-10-11 15:12:58,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:12:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1737 transitions. [2020-10-11 15:12:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:12:58,774 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:58,774 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:58,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 15:12:58,775 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:58,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:58,775 INFO L82 PathProgramCache]: Analyzing trace with hash -404806880, now seen corresponding path program 1 times [2020-10-11 15:12:58,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:58,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132001193] [2020-10-11 15:12:58,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:58,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132001193] [2020-10-11 15:12:58,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:58,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:12:58,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36259559] [2020-10-11 15:12:58,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:12:58,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:58,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:12:58,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:12:58,810 INFO L87 Difference]: Start difference. First operand 559 states and 1737 transitions. Second operand 5 states. [2020-10-11 15:12:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:58,878 INFO L93 Difference]: Finished difference Result 817 states and 2317 transitions. [2020-10-11 15:12:58,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:12:58,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-11 15:12:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:58,885 INFO L225 Difference]: With dead ends: 817 [2020-10-11 15:12:58,885 INFO L226 Difference]: Without dead ends: 812 [2020-10-11 15:12:58,886 INFO L673 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-10-11 15:12:58,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-10-11 15:12:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 585. [2020-10-11 15:12:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2020-10-11 15:12:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1832 transitions. [2020-10-11 15:12:58,913 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1832 transitions. Word has length 9 [2020-10-11 15:12:58,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:58,913 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 1832 transitions. [2020-10-11 15:12:58,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:12:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1832 transitions. [2020-10-11 15:12:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:12:58,915 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:58,915 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:58,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 15:12:58,915 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:58,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:58,915 INFO L82 PathProgramCache]: Analyzing trace with hash -669323978, now seen corresponding path program 1 times [2020-10-11 15:12:58,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:58,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926697506] [2020-10-11 15:12:58,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:58,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:12:58,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926697506] [2020-10-11 15:12:58,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:58,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:12:58,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546185534] [2020-10-11 15:12:58,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:12:58,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:58,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:12:58,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:12:58,972 INFO L87 Difference]: Start difference. First operand 585 states and 1832 transitions. Second operand 5 states. [2020-10-11 15:12:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:59,039 INFO L93 Difference]: Finished difference Result 843 states and 2406 transitions. [2020-10-11 15:12:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:12:59,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:12:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:59,046 INFO L225 Difference]: With dead ends: 843 [2020-10-11 15:12:59,046 INFO L226 Difference]: Without dead ends: 836 [2020-10-11 15:12:59,046 INFO L673 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-10-11 15:12:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-10-11 15:12:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 611. [2020-10-11 15:12:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2020-10-11 15:12:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1906 transitions. [2020-10-11 15:12:59,073 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1906 transitions. Word has length 13 [2020-10-11 15:12:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:59,073 INFO L481 AbstractCegarLoop]: Abstraction has 611 states and 1906 transitions. [2020-10-11 15:12:59,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:12:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1906 transitions. [2020-10-11 15:12:59,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:12:59,075 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:59,075 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:59,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 15:12:59,075 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:59,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:59,076 INFO L82 PathProgramCache]: Analyzing trace with hash -56737855, now seen corresponding path program 1 times [2020-10-11 15:12:59,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:59,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827869109] [2020-10-11 15:12:59,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:59,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827869109] [2020-10-11 15:12:59,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312545381] [2020-10-11 15:12:59,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:12:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:59,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:12:59,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:12:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:59,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:12:59,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:12:59,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265834670] [2020-10-11 15:12:59,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:12:59,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:59,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:12:59,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:12:59,233 INFO L87 Difference]: Start difference. First operand 611 states and 1906 transitions. Second operand 9 states. [2020-10-11 15:12:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:59,393 INFO L93 Difference]: Finished difference Result 1059 states and 2818 transitions. [2020-10-11 15:12:59,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:12:59,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-11 15:12:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:59,401 INFO L225 Difference]: With dead ends: 1059 [2020-10-11 15:12:59,401 INFO L226 Difference]: Without dead ends: 1052 [2020-10-11 15:12:59,401 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:12:59,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-10-11 15:12:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 591. [2020-10-11 15:12:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-11 15:12:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1840 transitions. [2020-10-11 15:12:59,429 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1840 transitions. Word has length 15 [2020-10-11 15:12:59,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:59,429 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 1840 transitions. [2020-10-11 15:12:59,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:12:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1840 transitions. [2020-10-11 15:12:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:12:59,430 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:59,431 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:59,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-11 15:12:59,645 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:59,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:59,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1024744543, now seen corresponding path program 2 times [2020-10-11 15:12:59,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:59,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020798935] [2020-10-11 15:12:59,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:12:59,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020798935] [2020-10-11 15:12:59,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:59,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:12:59,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78965050] [2020-10-11 15:12:59,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:12:59,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:59,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:12:59,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:12:59,706 INFO L87 Difference]: Start difference. First operand 591 states and 1840 transitions. Second operand 7 states. [2020-10-11 15:12:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:59,876 INFO L93 Difference]: Finished difference Result 1053 states and 2807 transitions. [2020-10-11 15:12:59,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:12:59,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 15:12:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:59,885 INFO L225 Difference]: With dead ends: 1053 [2020-10-11 15:12:59,886 INFO L226 Difference]: Without dead ends: 1045 [2020-10-11 15:12:59,886 INFO L673 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-10-11 15:12:59,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-10-11 15:12:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2020-10-11 15:12:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-10-11 15:12:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2020-10-11 15:12:59,918 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2020-10-11 15:12:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:59,918 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2020-10-11 15:12:59,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:12:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2020-10-11 15:12:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 15:12:59,920 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:59,920 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:59,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 15:12:59,920 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:59,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:59,921 INFO L82 PathProgramCache]: Analyzing trace with hash 68174732, now seen corresponding path program 1 times [2020-10-11 15:12:59,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:59,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035734132] [2020-10-11 15:12:59,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:12:59,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035734132] [2020-10-11 15:12:59,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:59,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:12:59,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433240257] [2020-10-11 15:12:59,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:12:59,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:59,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:12:59,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:12:59,961 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2020-10-11 15:13:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:00,025 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2020-10-11 15:13:00,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:00,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-11 15:13:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:00,031 INFO L225 Difference]: With dead ends: 736 [2020-10-11 15:13:00,032 INFO L226 Difference]: Without dead ends: 728 [2020-10-11 15:13:00,032 INFO L673 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-10-11 15:13:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-10-11 15:13:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2020-10-11 15:13:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-10-11 15:13:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2020-10-11 15:13:00,081 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2020-10-11 15:13:00,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:00,081 INFO L481 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2020-10-11 15:13:00,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2020-10-11 15:13:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:13:00,082 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:00,082 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:00,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 15:13:00,083 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:00,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2109628021, now seen corresponding path program 1 times [2020-10-11 15:13:00,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:00,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513092592] [2020-10-11 15:13:00,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:13:00,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:13:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:13:00,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:13:00,109 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:13:00,109 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:13:00,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 15:13:00,110 WARN L371 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-11 15:13:00,111 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-10-11 15:13:00,122 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,122 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,122 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,123 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,123 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,123 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,123 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,123 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,124 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,124 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,124 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,124 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,124 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,124 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,125 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,125 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,128 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,128 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,128 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,129 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,129 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,129 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,129 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,129 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,129 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,129 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,129 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,129 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,129 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,130 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,130 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,130 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,130 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,130 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,130 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,130 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,138 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,138 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,138 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,138 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,138 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,142 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,142 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,143 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,143 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,143 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,144 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,144 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,145 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,145 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,145 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,146 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,146 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,147 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,147 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,147 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,154 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,156 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:00,157 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 15:13:00,157 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:13:00,157 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:13:00,157 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:13:00,157 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:13:00,158 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:13:00,158 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:13:00,158 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:13:00,158 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:13:00,160 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:13:00,160 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 105 transitions, 274 flow [2020-10-11 15:13:00,160 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 105 transitions, 274 flow [2020-10-11 15:13:00,160 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions, 274 flow [2020-10-11 15:13:00,179 INFO L129 PetriNetUnfolder]: 6/127 cut-off events. [2020-10-11 15:13:00,179 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-11 15:13:00,181 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-10-11 15:13:00,185 INFO L117 LiptonReduction]: Number of co-enabled transitions 2192 [2020-10-11 15:13:01,774 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-10-11 15:13:01,841 INFO L132 LiptonReduction]: Checked pairs total: 2978 [2020-10-11 15:13:01,841 INFO L134 LiptonReduction]: Total number of compositions: 97 [2020-10-11 15:13:01,842 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 33 transitions, 130 flow [2020-10-11 15:13:01,958 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2020-10-11 15:13:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2020-10-11 15:13:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:13:01,959 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:01,959 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:13:01,959 INFO L429 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-10-11 15:13:01,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:01,960 INFO L82 PathProgramCache]: Analyzing trace with hash 753552, now seen corresponding path program 1 times [2020-10-11 15:13:01,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:01,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601902038] [2020-10-11 15:13:01,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:01,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601902038] [2020-10-11 15:13:01,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:01,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:13:01,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940044550] [2020-10-11 15:13:01,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:13:01,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:01,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:13:01,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:13:01,979 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2020-10-11 15:13:02,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:02,025 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2020-10-11 15:13:02,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:13:02,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:13:02,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:02,041 INFO L225 Difference]: With dead ends: 1889 [2020-10-11 15:13:02,041 INFO L226 Difference]: Without dead ends: 1767 [2020-10-11 15:13:02,041 INFO L673 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-10-11 15:13:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2020-10-11 15:13:02,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2020-10-11 15:13:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2020-10-11 15:13:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 6690 transitions. [2020-10-11 15:13:02,129 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 6690 transitions. Word has length 3 [2020-10-11 15:13:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:02,129 INFO L481 AbstractCegarLoop]: Abstraction has 1767 states and 6690 transitions. [2020-10-11 15:13:02,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:13:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 6690 transitions. [2020-10-11 15:13:02,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:13:02,130 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:02,130 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:02,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 15:13:02,130 INFO L429 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-10-11 15:13:02,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:02,131 INFO L82 PathProgramCache]: Analyzing trace with hash -260829075, now seen corresponding path program 1 times [2020-10-11 15:13:02,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:02,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705717870] [2020-10-11 15:13:02,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:02,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705717870] [2020-10-11 15:13:02,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:02,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:02,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913506256] [2020-10-11 15:13:02,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:02,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:02,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:02,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:02,159 INFO L87 Difference]: Start difference. First operand 1767 states and 6690 transitions. Second operand 5 states. [2020-10-11 15:13:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:02,259 INFO L93 Difference]: Finished difference Result 2905 states and 10138 transitions. [2020-10-11 15:13:02,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:02,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-11 15:13:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:02,284 INFO L225 Difference]: With dead ends: 2905 [2020-10-11 15:13:02,285 INFO L226 Difference]: Without dead ends: 2899 [2020-10-11 15:13:02,285 INFO L673 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-10-11 15:13:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-10-11 15:13:02,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1966. [2020-10-11 15:13:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2020-10-11 15:13:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 7503 transitions. [2020-10-11 15:13:02,390 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 7503 transitions. Word has length 9 [2020-10-11 15:13:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:02,390 INFO L481 AbstractCegarLoop]: Abstraction has 1966 states and 7503 transitions. [2020-10-11 15:13:02,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 7503 transitions. [2020-10-11 15:13:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:13:02,391 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:02,391 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:02,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 15:13:02,392 INFO L429 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-10-11 15:13:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1408743431, now seen corresponding path program 1 times [2020-10-11 15:13:02,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:02,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070007946] [2020-10-11 15:13:02,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:02,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070007946] [2020-10-11 15:13:02,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:02,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:02,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004764107] [2020-10-11 15:13:02,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:02,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:02,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:02,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:02,424 INFO L87 Difference]: Start difference. First operand 1966 states and 7503 transitions. Second operand 5 states. [2020-10-11 15:13:02,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:02,526 INFO L93 Difference]: Finished difference Result 3204 states and 11312 transitions. [2020-10-11 15:13:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:02,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:13:02,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:02,555 INFO L225 Difference]: With dead ends: 3204 [2020-10-11 15:13:02,555 INFO L226 Difference]: Without dead ends: 3194 [2020-10-11 15:13:02,556 INFO L673 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-10-11 15:13:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2020-10-11 15:13:02,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2200. [2020-10-11 15:13:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2020-10-11 15:13:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 8453 transitions. [2020-10-11 15:13:02,658 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 8453 transitions. Word has length 13 [2020-10-11 15:13:02,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:02,659 INFO L481 AbstractCegarLoop]: Abstraction has 2200 states and 8453 transitions. [2020-10-11 15:13:02,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 8453 transitions. [2020-10-11 15:13:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:13:02,660 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:02,660 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:02,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 15:13:02,660 INFO L429 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-10-11 15:13:02,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:02,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1555768808, now seen corresponding path program 1 times [2020-10-11 15:13:02,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:02,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408828723] [2020-10-11 15:13:02,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:02,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408828723] [2020-10-11 15:13:02,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859968877] [2020-10-11 15:13:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:02,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:02,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:02,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:02,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:02,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287262093] [2020-10-11 15:13:02,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:02,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:02,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:02,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:02,783 INFO L87 Difference]: Start difference. First operand 2200 states and 8453 transitions. Second operand 9 states. [2020-10-11 15:13:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:03,057 INFO L93 Difference]: Finished difference Result 4556 states and 14911 transitions. [2020-10-11 15:13:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:03,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-11 15:13:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:03,078 INFO L225 Difference]: With dead ends: 4556 [2020-10-11 15:13:03,079 INFO L226 Difference]: Without dead ends: 4546 [2020-10-11 15:13:03,079 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:03,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2020-10-11 15:13:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2157. [2020-10-11 15:13:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2020-10-11 15:13:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 8278 transitions. [2020-10-11 15:13:03,195 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 8278 transitions. Word has length 15 [2020-10-11 15:13:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:03,195 INFO L481 AbstractCegarLoop]: Abstraction has 2157 states and 8278 transitions. [2020-10-11 15:13:03,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 8278 transitions. [2020-10-11 15:13:03,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:13:03,196 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:03,197 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:03,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-11 15:13:03,411 INFO L429 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-10-11 15:13:03,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:03,411 INFO L82 PathProgramCache]: Analyzing trace with hash -887756896, now seen corresponding path program 2 times [2020-10-11 15:13:03,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:03,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854291321] [2020-10-11 15:13:03,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:03,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:03,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854291321] [2020-10-11 15:13:03,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:03,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:03,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965860012] [2020-10-11 15:13:03,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:03,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:03,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:03,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:03,455 INFO L87 Difference]: Start difference. First operand 2157 states and 8278 transitions. Second operand 7 states. [2020-10-11 15:13:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:03,656 INFO L93 Difference]: Finished difference Result 4612 states and 15111 transitions. [2020-10-11 15:13:03,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:03,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 15:13:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:03,675 INFO L225 Difference]: With dead ends: 4612 [2020-10-11 15:13:03,675 INFO L226 Difference]: Without dead ends: 4601 [2020-10-11 15:13:03,677 INFO L673 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-10-11 15:13:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2020-10-11 15:13:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 2035. [2020-10-11 15:13:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2020-10-11 15:13:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 7845 transitions. [2020-10-11 15:13:03,779 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 7845 transitions. Word has length 15 [2020-10-11 15:13:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:03,779 INFO L481 AbstractCegarLoop]: Abstraction has 2035 states and 7845 transitions. [2020-10-11 15:13:03,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 7845 transitions. [2020-10-11 15:13:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 15:13:03,780 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:03,780 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:03,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 15:13:03,780 INFO L429 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-10-11 15:13:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:03,781 INFO L82 PathProgramCache]: Analyzing trace with hash 695111130, now seen corresponding path program 1 times [2020-10-11 15:13:03,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:03,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684110796] [2020-10-11 15:13:03,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:03,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684110796] [2020-10-11 15:13:03,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:03,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:03,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632969048] [2020-10-11 15:13:03,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:03,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:03,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:03,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:03,813 INFO L87 Difference]: Start difference. First operand 2035 states and 7845 transitions. Second operand 5 states. [2020-10-11 15:13:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:03,891 INFO L93 Difference]: Finished difference Result 3265 states and 11681 transitions. [2020-10-11 15:13:03,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:03,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-11 15:13:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:03,904 INFO L225 Difference]: With dead ends: 3265 [2020-10-11 15:13:03,904 INFO L226 Difference]: Without dead ends: 3250 [2020-10-11 15:13:03,905 INFO L673 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-10-11 15:13:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-10-11 15:13:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2281. [2020-10-11 15:13:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2020-10-11 15:13:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 8755 transitions. [2020-10-11 15:13:03,999 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 8755 transitions. Word has length 17 [2020-10-11 15:13:03,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:03,999 INFO L481 AbstractCegarLoop]: Abstraction has 2281 states and 8755 transitions. [2020-10-11 15:13:03,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 8755 transitions. [2020-10-11 15:13:04,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:04,001 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:04,001 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:04,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 15:13:04,001 INFO L429 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-10-11 15:13:04,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:04,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1754455113, now seen corresponding path program 1 times [2020-10-11 15:13:04,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:04,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039746890] [2020-10-11 15:13:04,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:04,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039746890] [2020-10-11 15:13:04,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826733590] [2020-10-11 15:13:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:04,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:04,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:04,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:04,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:04,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310859132] [2020-10-11 15:13:04,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:04,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:04,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:04,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:04,159 INFO L87 Difference]: Start difference. First operand 2281 states and 8755 transitions. Second operand 9 states. [2020-10-11 15:13:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:04,370 INFO L93 Difference]: Finished difference Result 4825 states and 15986 transitions. [2020-10-11 15:13:04,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:04,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-11 15:13:04,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:04,394 INFO L225 Difference]: With dead ends: 4825 [2020-10-11 15:13:04,394 INFO L226 Difference]: Without dead ends: 4813 [2020-10-11 15:13:04,395 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2020-10-11 15:13:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 2305. [2020-10-11 15:13:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2020-10-11 15:13:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 8815 transitions. [2020-10-11 15:13:04,553 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 8815 transitions. Word has length 19 [2020-10-11 15:13:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:04,553 INFO L481 AbstractCegarLoop]: Abstraction has 2305 states and 8815 transitions. [2020-10-11 15:13:04,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 8815 transitions. [2020-10-11 15:13:04,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:04,557 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:04,558 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:04,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:04,772 INFO L429 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-10-11 15:13:04,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:04,773 INFO L82 PathProgramCache]: Analyzing trace with hash -131464925, now seen corresponding path program 1 times [2020-10-11 15:13:04,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:04,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110549917] [2020-10-11 15:13:04,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:04,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110549917] [2020-10-11 15:13:04,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250444820] [2020-10-11 15:13:04,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:04,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:04,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:04,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:04,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:04,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644053204] [2020-10-11 15:13:04,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:04,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:04,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:04,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:04,956 INFO L87 Difference]: Start difference. First operand 2305 states and 8815 transitions. Second operand 9 states. [2020-10-11 15:13:05,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:05,195 INFO L93 Difference]: Finished difference Result 4942 states and 16410 transitions. [2020-10-11 15:13:05,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:05,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-11 15:13:05,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:05,210 INFO L225 Difference]: With dead ends: 4942 [2020-10-11 15:13:05,210 INFO L226 Difference]: Without dead ends: 4925 [2020-10-11 15:13:05,211 INFO L673 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-10-11 15:13:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2020-10-11 15:13:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 2299. [2020-10-11 15:13:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2020-10-11 15:13:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 8782 transitions. [2020-10-11 15:13:05,305 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 8782 transitions. Word has length 19 [2020-10-11 15:13:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:05,305 INFO L481 AbstractCegarLoop]: Abstraction has 2299 states and 8782 transitions. [2020-10-11 15:13:05,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:05,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 8782 transitions. [2020-10-11 15:13:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:05,307 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:05,307 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:05,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:05,521 INFO L429 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-10-11 15:13:05,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:05,522 INFO L82 PathProgramCache]: Analyzing trace with hash -2013120191, now seen corresponding path program 2 times [2020-10-11 15:13:05,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:05,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455040138] [2020-10-11 15:13:05,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:05,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455040138] [2020-10-11 15:13:05,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:05,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:05,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105342608] [2020-10-11 15:13:05,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:05,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:05,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:05,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:05,567 INFO L87 Difference]: Start difference. First operand 2299 states and 8782 transitions. Second operand 7 states. [2020-10-11 15:13:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:05,758 INFO L93 Difference]: Finished difference Result 4934 states and 16393 transitions. [2020-10-11 15:13:05,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:05,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:13:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:05,772 INFO L225 Difference]: With dead ends: 4934 [2020-10-11 15:13:05,772 INFO L226 Difference]: Without dead ends: 4917 [2020-10-11 15:13:05,773 INFO L673 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-10-11 15:13:05,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2020-10-11 15:13:05,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 2216. [2020-10-11 15:13:05,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2020-10-11 15:13:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 8477 transitions. [2020-10-11 15:13:05,866 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 8477 transitions. Word has length 19 [2020-10-11 15:13:05,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:05,866 INFO L481 AbstractCegarLoop]: Abstraction has 2216 states and 8477 transitions. [2020-10-11 15:13:05,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 8477 transitions. [2020-10-11 15:13:05,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:05,868 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:05,868 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:05,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-11 15:13:05,868 INFO L429 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-10-11 15:13:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:05,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2013113743, now seen corresponding path program 2 times [2020-10-11 15:13:05,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:05,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467674021] [2020-10-11 15:13:05,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:05,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467674021] [2020-10-11 15:13:05,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:05,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:05,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709261959] [2020-10-11 15:13:05,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:05,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:05,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:05,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:05,913 INFO L87 Difference]: Start difference. First operand 2216 states and 8477 transitions. Second operand 7 states. [2020-10-11 15:13:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:06,110 INFO L93 Difference]: Finished difference Result 4774 states and 15828 transitions. [2020-10-11 15:13:06,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:06,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:13:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:06,119 INFO L225 Difference]: With dead ends: 4774 [2020-10-11 15:13:06,119 INFO L226 Difference]: Without dead ends: 4757 [2020-10-11 15:13:06,119 INFO L673 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-10-11 15:13:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2020-10-11 15:13:06,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 2150. [2020-10-11 15:13:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2020-10-11 15:13:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 8243 transitions. [2020-10-11 15:13:06,188 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 8243 transitions. Word has length 19 [2020-10-11 15:13:06,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:06,188 INFO L481 AbstractCegarLoop]: Abstraction has 2150 states and 8243 transitions. [2020-10-11 15:13:06,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 8243 transitions. [2020-10-11 15:13:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:06,190 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:06,190 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:06,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-11 15:13:06,190 INFO L429 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-10-11 15:13:06,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:06,191 INFO L82 PathProgramCache]: Analyzing trace with hash -9146414, now seen corresponding path program 1 times [2020-10-11 15:13:06,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:06,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905363633] [2020-10-11 15:13:06,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:06,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905363633] [2020-10-11 15:13:06,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867145937] [2020-10-11 15:13:06,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:06,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:06,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:06,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:06,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:06,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913603130] [2020-10-11 15:13:06,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:06,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:06,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:06,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:06,405 INFO L87 Difference]: Start difference. First operand 2150 states and 8243 transitions. Second operand 11 states. [2020-10-11 15:13:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:06,936 INFO L93 Difference]: Finished difference Result 6025 states and 18746 transitions. [2020-10-11 15:13:06,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:06,937 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:06,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:06,946 INFO L225 Difference]: With dead ends: 6025 [2020-10-11 15:13:06,947 INFO L226 Difference]: Without dead ends: 6017 [2020-10-11 15:13:06,947 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-10-11 15:13:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 2117. [2020-10-11 15:13:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2020-10-11 15:13:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 8106 transitions. [2020-10-11 15:13:07,012 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 8106 transitions. Word has length 21 [2020-10-11 15:13:07,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:07,012 INFO L481 AbstractCegarLoop]: Abstraction has 2117 states and 8106 transitions. [2020-10-11 15:13:07,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 8106 transitions. [2020-10-11 15:13:07,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:07,014 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:07,014 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:07,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-10-11 15:13:07,220 INFO L429 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-10-11 15:13:07,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:07,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1890795232, now seen corresponding path program 2 times [2020-10-11 15:13:07,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:07,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442389416] [2020-10-11 15:13:07,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:07,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442389416] [2020-10-11 15:13:07,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550886062] [2020-10-11 15:13:07,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:07,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:13:07,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:07,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:07,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:07,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:07,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:07,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663516283] [2020-10-11 15:13:07,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:07,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:07,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:07,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:07,396 INFO L87 Difference]: Start difference. First operand 2117 states and 8106 transitions. Second operand 11 states. [2020-10-11 15:13:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:07,934 INFO L93 Difference]: Finished difference Result 5914 states and 18384 transitions. [2020-10-11 15:13:07,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:07,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:07,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:07,948 INFO L225 Difference]: With dead ends: 5914 [2020-10-11 15:13:07,948 INFO L226 Difference]: Without dead ends: 5903 [2020-10-11 15:13:07,951 INFO L673 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-10-11 15:13:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2020-10-11 15:13:08,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 2085. [2020-10-11 15:13:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2020-10-11 15:13:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 7975 transitions. [2020-10-11 15:13:08,042 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 7975 transitions. Word has length 21 [2020-10-11 15:13:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:08,043 INFO L481 AbstractCegarLoop]: Abstraction has 2085 states and 7975 transitions. [2020-10-11 15:13:08,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 7975 transitions. [2020-10-11 15:13:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:08,045 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:08,045 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:08,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:08,259 INFO L429 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-10-11 15:13:08,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:08,261 INFO L82 PathProgramCache]: Analyzing trace with hash 180724060, now seen corresponding path program 3 times [2020-10-11 15:13:08,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:08,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976462788] [2020-10-11 15:13:08,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:08,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976462788] [2020-10-11 15:13:08,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497521979] [2020-10-11 15:13:08,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:08,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:13:08,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:08,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:08,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:08,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:08,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:08,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436017136] [2020-10-11 15:13:08,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:08,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:08,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:08,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:08,626 INFO L87 Difference]: Start difference. First operand 2085 states and 7975 transitions. Second operand 11 states. [2020-10-11 15:13:09,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:09,114 INFO L93 Difference]: Finished difference Result 5907 states and 18375 transitions. [2020-10-11 15:13:09,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:09,115 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:09,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:09,123 INFO L225 Difference]: With dead ends: 5907 [2020-10-11 15:13:09,123 INFO L226 Difference]: Without dead ends: 5899 [2020-10-11 15:13:09,124 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2020-10-11 15:13:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 2008. [2020-10-11 15:13:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2020-10-11 15:13:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 7698 transitions. [2020-10-11 15:13:09,218 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 7698 transitions. Word has length 21 [2020-10-11 15:13:09,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:09,218 INFO L481 AbstractCegarLoop]: Abstraction has 2008 states and 7698 transitions. [2020-10-11 15:13:09,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 7698 transitions. [2020-10-11 15:13:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:09,220 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:09,220 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:09,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-10-11 15:13:09,434 INFO L429 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-10-11 15:13:09,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:09,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1783759286, now seen corresponding path program 4 times [2020-10-11 15:13:09,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:09,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657467883] [2020-10-11 15:13:09,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:09,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657467883] [2020-10-11 15:13:09,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207994333] [2020-10-11 15:13:09,488 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:09,568 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:13:09,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:09,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:09,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:09,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:09,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:09,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286888328] [2020-10-11 15:13:09,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:09,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:09,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:09,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:09,597 INFO L87 Difference]: Start difference. First operand 2008 states and 7698 transitions. Second operand 11 states. [2020-10-11 15:13:10,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:10,104 INFO L93 Difference]: Finished difference Result 5835 states and 18155 transitions. [2020-10-11 15:13:10,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:10,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:10,114 INFO L225 Difference]: With dead ends: 5835 [2020-10-11 15:13:10,114 INFO L226 Difference]: Without dead ends: 5824 [2020-10-11 15:13:10,115 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2020-10-11 15:13:10,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 1976. [2020-10-11 15:13:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2020-10-11 15:13:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 7567 transitions. [2020-10-11 15:13:10,181 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 7567 transitions. Word has length 21 [2020-10-11 15:13:10,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:10,181 INFO L481 AbstractCegarLoop]: Abstraction has 1976 states and 7567 transitions. [2020-10-11 15:13:10,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 7567 transitions. [2020-10-11 15:13:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:10,183 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:10,183 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:10,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-10-11 15:13:10,398 INFO L429 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-10-11 15:13:10,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:10,398 INFO L82 PathProgramCache]: Analyzing trace with hash -964809789, now seen corresponding path program 1 times [2020-10-11 15:13:10,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:10,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820213707] [2020-10-11 15:13:10,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:13:10,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820213707] [2020-10-11 15:13:10,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:10,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:10,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547792575] [2020-10-11 15:13:10,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:10,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:10,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:10,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:10,441 INFO L87 Difference]: Start difference. First operand 1976 states and 7567 transitions. Second operand 5 states. [2020-10-11 15:13:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:10,513 INFO L93 Difference]: Finished difference Result 3016 states and 10840 transitions. [2020-10-11 15:13:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:10,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-11 15:13:10,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:10,522 INFO L225 Difference]: With dead ends: 3016 [2020-10-11 15:13:10,522 INFO L226 Difference]: Without dead ends: 3000 [2020-10-11 15:13:10,522 INFO L673 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-10-11 15:13:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-10-11 15:13:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 2183. [2020-10-11 15:13:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2020-10-11 15:13:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 8210 transitions. [2020-10-11 15:13:10,629 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 8210 transitions. Word has length 21 [2020-10-11 15:13:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:10,630 INFO L481 AbstractCegarLoop]: Abstraction has 2183 states and 8210 transitions. [2020-10-11 15:13:10,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 8210 transitions. [2020-10-11 15:13:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:10,631 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:10,631 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:10,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-11 15:13:10,631 INFO L429 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-10-11 15:13:10,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:10,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1873231848, now seen corresponding path program 5 times [2020-10-11 15:13:10,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:10,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968903403] [2020-10-11 15:13:10,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:10,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-10-11 15:13:10,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968903403] [2020-10-11 15:13:10,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:10,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:13:10,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868865682] [2020-10-11 15:13:10,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:10,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:10,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:10,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:10,684 INFO L87 Difference]: Start difference. First operand 2183 states and 8210 transitions. Second operand 9 states. [2020-10-11 15:13:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:11,184 INFO L93 Difference]: Finished difference Result 6150 states and 19247 transitions. [2020-10-11 15:13:11,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:11,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:13:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:11,196 INFO L225 Difference]: With dead ends: 6150 [2020-10-11 15:13:11,196 INFO L226 Difference]: Without dead ends: 6139 [2020-10-11 15:13:11,196 INFO L673 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-10-11 15:13:11,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6139 states. [2020-10-11 15:13:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6139 to 2096. [2020-10-11 15:13:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2020-10-11 15:13:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 7876 transitions. [2020-10-11 15:13:11,285 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 7876 transitions. Word has length 21 [2020-10-11 15:13:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:11,285 INFO L481 AbstractCegarLoop]: Abstraction has 2096 states and 7876 transitions. [2020-10-11 15:13:11,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 7876 transitions. [2020-10-11 15:13:11,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:11,286 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:11,286 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:11,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-11 15:13:11,287 INFO L429 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-10-11 15:13:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1867041768, now seen corresponding path program 6 times [2020-10-11 15:13:11,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:11,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971073940] [2020-10-11 15:13:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:11,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971073940] [2020-10-11 15:13:11,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:11,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:13:11,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771009921] [2020-10-11 15:13:11,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:11,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:11,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:11,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:11,349 INFO L87 Difference]: Start difference. First operand 2096 states and 7876 transitions. Second operand 9 states. [2020-10-11 15:13:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:11,795 INFO L93 Difference]: Finished difference Result 6017 states and 18791 transitions. [2020-10-11 15:13:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:11,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:13:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:11,804 INFO L225 Difference]: With dead ends: 6017 [2020-10-11 15:13:11,805 INFO L226 Difference]: Without dead ends: 6002 [2020-10-11 15:13:11,805 INFO L673 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-10-11 15:13:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-10-11 15:13:11,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2020-10-11 15:13:11,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2020-10-11 15:13:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2020-10-11 15:13:11,894 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2020-10-11 15:13:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:11,895 INFO L481 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2020-10-11 15:13:11,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2020-10-11 15:13:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:13:11,897 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:11,897 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:11,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-11 15:13:11,898 INFO L429 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-10-11 15:13:11,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:11,899 INFO L82 PathProgramCache]: Analyzing trace with hash 150840888, now seen corresponding path program 1 times [2020-10-11 15:13:11,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:11,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950539096] [2020-10-11 15:13:11,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:13:11,914 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:13:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:13:11,922 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:13:11,938 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:13:11,938 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:13:11,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-11 15:13:11,939 WARN L371 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-11 15:13:11,940 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-10-11 15:13:11,953 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,954 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,954 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,954 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,954 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,954 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,954 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,954 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,955 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,955 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,955 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,955 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,955 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,955 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,955 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,955 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,956 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,956 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,956 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,956 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,956 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,956 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,956 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,957 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,957 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,957 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,957 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,957 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,957 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,957 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,958 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,958 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,958 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,958 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,958 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,958 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,958 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,959 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,959 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,959 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,959 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,959 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,959 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,959 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,959 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,962 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,962 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,964 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,964 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,967 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,967 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,967 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,967 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,969 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,969 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,969 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,969 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,969 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,970 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,970 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,972 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,972 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,972 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,972 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,972 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,976 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,977 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,977 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,977 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,977 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,980 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,981 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,981 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,981 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,981 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,982 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,982 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,982 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,982 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,983 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,992 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-11 15:13:11,993 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:13:11,993 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:13:11,993 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:13:11,993 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:13:11,993 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:13:11,993 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:13:11,993 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:13:11,993 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:13:11,995 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:13:11,997 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 123 transitions, 336 flow [2020-10-11 15:13:11,997 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 123 transitions, 336 flow [2020-10-11 15:13:11,998 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions, 336 flow [2020-10-11 15:13:12,030 INFO L129 PetriNetUnfolder]: 7/149 cut-off events. [2020-10-11 15:13:12,031 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-11 15:13:12,033 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-10-11 15:13:12,039 INFO L117 LiptonReduction]: Number of co-enabled transitions 2860 [2020-10-11 15:13:13,781 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-10-11 15:13:13,855 INFO L132 LiptonReduction]: Checked pairs total: 4168 [2020-10-11 15:13:13,855 INFO L134 LiptonReduction]: Total number of compositions: 121 [2020-10-11 15:13:13,855 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 39 transitions, 168 flow [2020-10-11 15:13:14,176 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2020-10-11 15:13:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2020-10-11 15:13:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:13:14,176 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:14,176 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:13:14,177 INFO L429 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-10-11 15:13:14,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:14,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1011964, now seen corresponding path program 1 times [2020-10-11 15:13:14,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:14,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191501736] [2020-10-11 15:13:14,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:14,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191501736] [2020-10-11 15:13:14,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:14,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:13:14,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752131125] [2020-10-11 15:13:14,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:13:14,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:14,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:13:14,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:13:14,188 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2020-10-11 15:13:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:14,261 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2020-10-11 15:13:14,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:13:14,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:13:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:14,280 INFO L225 Difference]: With dead ends: 5844 [2020-10-11 15:13:14,280 INFO L226 Difference]: Without dead ends: 5479 [2020-10-11 15:13:14,280 INFO L673 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-10-11 15:13:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-10-11 15:13:14,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-10-11 15:13:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-10-11 15:13:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 24493 transitions. [2020-10-11 15:13:14,452 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 24493 transitions. Word has length 3 [2020-10-11 15:13:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:14,452 INFO L481 AbstractCegarLoop]: Abstraction has 5479 states and 24493 transitions. [2020-10-11 15:13:14,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:13:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 24493 transitions. [2020-10-11 15:13:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:13:14,453 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:14,453 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:14,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-11 15:13:14,453 INFO L429 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-10-11 15:13:14,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1084774388, now seen corresponding path program 1 times [2020-10-11 15:13:14,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:14,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844867309] [2020-10-11 15:13:14,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:14,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844867309] [2020-10-11 15:13:14,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:14,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:14,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643659509] [2020-10-11 15:13:14,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:14,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:14,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:14,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:14,478 INFO L87 Difference]: Start difference. First operand 5479 states and 24493 transitions. Second operand 5 states. [2020-10-11 15:13:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:14,591 INFO L93 Difference]: Finished difference Result 9673 states and 40333 transitions. [2020-10-11 15:13:14,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:14,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-11 15:13:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:14,612 INFO L225 Difference]: With dead ends: 9673 [2020-10-11 15:13:14,612 INFO L226 Difference]: Without dead ends: 9666 [2020-10-11 15:13:14,613 INFO L673 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-10-11 15:13:14,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2020-10-11 15:13:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 6331. [2020-10-11 15:13:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6331 states. [2020-10-11 15:13:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 28544 transitions. [2020-10-11 15:13:14,940 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 28544 transitions. Word has length 9 [2020-10-11 15:13:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:14,941 INFO L481 AbstractCegarLoop]: Abstraction has 6331 states and 28544 transitions. [2020-10-11 15:13:14,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 28544 transitions. [2020-10-11 15:13:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:13:14,941 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:14,941 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:14,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-11 15:13:14,941 INFO L429 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-10-11 15:13:14,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:14,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2112403116, now seen corresponding path program 1 times [2020-10-11 15:13:14,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:14,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981103328] [2020-10-11 15:13:14,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:14,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981103328] [2020-10-11 15:13:14,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:14,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:14,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328647836] [2020-10-11 15:13:14,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:14,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:14,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:14,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:14,968 INFO L87 Difference]: Start difference. First operand 6331 states and 28544 transitions. Second operand 5 states. [2020-10-11 15:13:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:15,119 INFO L93 Difference]: Finished difference Result 11081 states and 46826 transitions. [2020-10-11 15:13:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:15,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:13:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:15,170 INFO L225 Difference]: With dead ends: 11081 [2020-10-11 15:13:15,171 INFO L226 Difference]: Without dead ends: 11068 [2020-10-11 15:13:15,172 INFO L673 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-10-11 15:13:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11068 states. [2020-10-11 15:13:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11068 to 7391. [2020-10-11 15:13:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7391 states. [2020-10-11 15:13:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 33694 transitions. [2020-10-11 15:13:15,622 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 33694 transitions. Word has length 13 [2020-10-11 15:13:15,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:15,622 INFO L481 AbstractCegarLoop]: Abstraction has 7391 states and 33694 transitions. [2020-10-11 15:13:15,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 33694 transitions. [2020-10-11 15:13:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:13:15,623 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:15,624 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:15,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-11 15:13:15,624 INFO L429 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-10-11 15:13:15,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:15,625 INFO L82 PathProgramCache]: Analyzing trace with hash -28983895, now seen corresponding path program 1 times [2020-10-11 15:13:15,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:15,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055970026] [2020-10-11 15:13:15,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:15,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055970026] [2020-10-11 15:13:15,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868420498] [2020-10-11 15:13:15,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:15,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:15,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:15,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:15,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:15,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233483015] [2020-10-11 15:13:15,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:15,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:15,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:15,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:15,775 INFO L87 Difference]: Start difference. First operand 7391 states and 33694 transitions. Second operand 9 states. [2020-10-11 15:13:16,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:16,025 INFO L93 Difference]: Finished difference Result 16749 states and 66010 transitions. [2020-10-11 15:13:16,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:16,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-11 15:13:16,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:16,060 INFO L225 Difference]: With dead ends: 16749 [2020-10-11 15:13:16,061 INFO L226 Difference]: Without dead ends: 16736 [2020-10-11 15:13:16,061 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16736 states. [2020-10-11 15:13:16,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16736 to 7303. [2020-10-11 15:13:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2020-10-11 15:13:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 33260 transitions. [2020-10-11 15:13:16,561 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 33260 transitions. Word has length 15 [2020-10-11 15:13:16,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:16,561 INFO L481 AbstractCegarLoop]: Abstraction has 7303 states and 33260 transitions. [2020-10-11 15:13:16,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:16,561 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 33260 transitions. [2020-10-11 15:13:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:13:16,561 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:16,561 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:16,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:16,763 INFO L429 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-10-11 15:13:16,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:16,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1500121559, now seen corresponding path program 2 times [2020-10-11 15:13:16,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:16,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697832565] [2020-10-11 15:13:16,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:16,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697832565] [2020-10-11 15:13:16,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:16,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:16,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275404829] [2020-10-11 15:13:16,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:16,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:16,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:16,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:16,796 INFO L87 Difference]: Start difference. First operand 7303 states and 33260 transitions. Second operand 7 states. [2020-10-11 15:13:17,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:17,064 INFO L93 Difference]: Finished difference Result 17085 states and 67393 transitions. [2020-10-11 15:13:17,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:17,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 15:13:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:17,106 INFO L225 Difference]: With dead ends: 17085 [2020-10-11 15:13:17,106 INFO L226 Difference]: Without dead ends: 17071 [2020-10-11 15:13:17,106 INFO L673 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-10-11 15:13:17,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2020-10-11 15:13:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 7048. [2020-10-11 15:13:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2020-10-11 15:13:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 32136 transitions. [2020-10-11 15:13:17,383 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 32136 transitions. Word has length 15 [2020-10-11 15:13:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:17,384 INFO L481 AbstractCegarLoop]: Abstraction has 7048 states and 32136 transitions. [2020-10-11 15:13:17,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 32136 transitions. [2020-10-11 15:13:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 15:13:17,384 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:17,384 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:17,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-11 15:13:17,385 INFO L429 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-10-11 15:13:17,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:17,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1891696605, now seen corresponding path program 1 times [2020-10-11 15:13:17,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:17,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478078037] [2020-10-11 15:13:17,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:17,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:17,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478078037] [2020-10-11 15:13:17,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:17,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:17,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436092041] [2020-10-11 15:13:17,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:17,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:17,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:17,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:17,426 INFO L87 Difference]: Start difference. First operand 7048 states and 32136 transitions. Second operand 5 states. [2020-10-11 15:13:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:17,549 INFO L93 Difference]: Finished difference Result 12234 states and 52488 transitions. [2020-10-11 15:13:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:17,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-11 15:13:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:17,578 INFO L225 Difference]: With dead ends: 12234 [2020-10-11 15:13:17,578 INFO L226 Difference]: Without dead ends: 12212 [2020-10-11 15:13:17,578 INFO L673 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-10-11 15:13:17,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2020-10-11 15:13:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 8342. [2020-10-11 15:13:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8342 states. [2020-10-11 15:13:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 38278 transitions. [2020-10-11 15:13:17,815 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 38278 transitions. Word has length 17 [2020-10-11 15:13:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:17,816 INFO L481 AbstractCegarLoop]: Abstraction has 8342 states and 38278 transitions. [2020-10-11 15:13:17,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 38278 transitions. [2020-10-11 15:13:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:17,817 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:17,817 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:17,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-11 15:13:17,817 INFO L429 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-10-11 15:13:17,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:17,818 INFO L82 PathProgramCache]: Analyzing trace with hash -74039136, now seen corresponding path program 1 times [2020-10-11 15:13:17,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:17,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767735490] [2020-10-11 15:13:17,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:13:17,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767735490] [2020-10-11 15:13:17,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189390946] [2020-10-11 15:13:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:17,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:17,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:13:17,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:17,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:17,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172752047] [2020-10-11 15:13:17,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:17,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:17,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:17,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:17,948 INFO L87 Difference]: Start difference. First operand 8342 states and 38278 transitions. Second operand 9 states. [2020-10-11 15:13:18,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:18,767 INFO L93 Difference]: Finished difference Result 19016 states and 76191 transitions. [2020-10-11 15:13:18,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:18,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-11 15:13:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:18,810 INFO L225 Difference]: With dead ends: 19016 [2020-10-11 15:13:18,811 INFO L226 Difference]: Without dead ends: 18998 [2020-10-11 15:13:18,811 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2020-10-11 15:13:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 8452. [2020-10-11 15:13:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8452 states. [2020-10-11 15:13:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8452 states to 8452 states and 38704 transitions. [2020-10-11 15:13:19,100 INFO L78 Accepts]: Start accepts. Automaton has 8452 states and 38704 transitions. Word has length 19 [2020-10-11 15:13:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:19,101 INFO L481 AbstractCegarLoop]: Abstraction has 8452 states and 38704 transitions. [2020-10-11 15:13:19,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 8452 states and 38704 transitions. [2020-10-11 15:13:19,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:19,102 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:19,102 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:19,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-10-11 15:13:19,309 INFO L429 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-10-11 15:13:19,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:19,310 INFO L82 PathProgramCache]: Analyzing trace with hash -274460668, now seen corresponding path program 1 times [2020-10-11 15:13:19,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:19,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281746116] [2020-10-11 15:13:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:19,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281746116] [2020-10-11 15:13:19,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116022759] [2020-10-11 15:13:19,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:19,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:19,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:19,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:19,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:19,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891373252] [2020-10-11 15:13:19,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:19,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:19,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:19,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:19,452 INFO L87 Difference]: Start difference. First operand 8452 states and 38704 transitions. Second operand 9 states. [2020-10-11 15:13:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:19,792 INFO L93 Difference]: Finished difference Result 19670 states and 79028 transitions. [2020-10-11 15:13:19,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:19,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-11 15:13:19,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:19,870 INFO L225 Difference]: With dead ends: 19670 [2020-10-11 15:13:19,870 INFO L226 Difference]: Without dead ends: 19645 [2020-10-11 15:13:19,870 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19645 states. [2020-10-11 15:13:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19645 to 8480. [2020-10-11 15:13:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8480 states. [2020-10-11 15:13:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 38825 transitions. [2020-10-11 15:13:20,258 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 38825 transitions. Word has length 19 [2020-10-11 15:13:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:20,258 INFO L481 AbstractCegarLoop]: Abstraction has 8480 states and 38825 transitions. [2020-10-11 15:13:20,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 38825 transitions. [2020-10-11 15:13:20,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:20,259 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:20,260 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:20,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-10-11 15:13:20,460 INFO L429 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-10-11 15:13:20,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:20,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1149256224, now seen corresponding path program 2 times [2020-10-11 15:13:20,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:20,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899201318] [2020-10-11 15:13:20,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:20,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899201318] [2020-10-11 15:13:20,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:20,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:20,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534259273] [2020-10-11 15:13:20,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:20,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:20,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:20,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:20,497 INFO L87 Difference]: Start difference. First operand 8480 states and 38825 transitions. Second operand 7 states. [2020-10-11 15:13:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:21,102 INFO L93 Difference]: Finished difference Result 19852 states and 79846 transitions. [2020-10-11 15:13:21,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:21,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:13:21,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:21,188 INFO L225 Difference]: With dead ends: 19852 [2020-10-11 15:13:21,188 INFO L226 Difference]: Without dead ends: 19827 [2020-10-11 15:13:21,189 INFO L673 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-10-11 15:13:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19827 states. [2020-10-11 15:13:21,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19827 to 8379. [2020-10-11 15:13:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8379 states. [2020-10-11 15:13:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8379 states to 8379 states and 38406 transitions. [2020-10-11 15:13:21,834 INFO L78 Accepts]: Start accepts. Automaton has 8379 states and 38406 transitions. Word has length 19 [2020-10-11 15:13:21,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:21,834 INFO L481 AbstractCegarLoop]: Abstraction has 8379 states and 38406 transitions. [2020-10-11 15:13:21,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 8379 states and 38406 transitions. [2020-10-11 15:13:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:21,836 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:21,836 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:21,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-11 15:13:21,836 INFO L429 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-10-11 15:13:21,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1149271290, now seen corresponding path program 2 times [2020-10-11 15:13:21,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:21,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934621666] [2020-10-11 15:13:21,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:21,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934621666] [2020-10-11 15:13:21,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:21,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:21,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122237400] [2020-10-11 15:13:21,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:21,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:21,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:21,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:21,877 INFO L87 Difference]: Start difference. First operand 8379 states and 38406 transitions. Second operand 7 states. [2020-10-11 15:13:22,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:22,132 INFO L93 Difference]: Finished difference Result 19555 states and 78564 transitions. [2020-10-11 15:13:22,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:22,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:13:22,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:22,176 INFO L225 Difference]: With dead ends: 19555 [2020-10-11 15:13:22,177 INFO L226 Difference]: Without dead ends: 19530 [2020-10-11 15:13:22,177 INFO L673 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-10-11 15:13:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2020-10-11 15:13:22,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 8317. [2020-10-11 15:13:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8317 states. [2020-10-11 15:13:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 38184 transitions. [2020-10-11 15:13:22,504 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 38184 transitions. Word has length 19 [2020-10-11 15:13:22,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:22,505 INFO L481 AbstractCegarLoop]: Abstraction has 8317 states and 38184 transitions. [2020-10-11 15:13:22,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:22,505 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 38184 transitions. [2020-10-11 15:13:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:22,506 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:22,507 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:22,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-11 15:13:22,507 INFO L429 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-10-11 15:13:22,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:22,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1557322431, now seen corresponding path program 1 times [2020-10-11 15:13:22,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:22,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72186715] [2020-10-11 15:13:22,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:22,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72186715] [2020-10-11 15:13:22,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164493825] [2020-10-11 15:13:22,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:22,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:22,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:22,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:22,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:22,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023356751] [2020-10-11 15:13:22,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:22,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:22,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:22,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:22,659 INFO L87 Difference]: Start difference. First operand 8317 states and 38184 transitions. Second operand 11 states. [2020-10-11 15:13:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:23,434 INFO L93 Difference]: Finished difference Result 26969 states and 101544 transitions. [2020-10-11 15:13:23,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:23,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:23,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:23,491 INFO L225 Difference]: With dead ends: 26969 [2020-10-11 15:13:23,491 INFO L226 Difference]: Without dead ends: 26957 [2020-10-11 15:13:23,492 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2020-10-11 15:13:23,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 8204. [2020-10-11 15:13:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2020-10-11 15:13:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 37628 transitions. [2020-10-11 15:13:23,872 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 37628 transitions. Word has length 21 [2020-10-11 15:13:23,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:23,872 INFO L481 AbstractCegarLoop]: Abstraction has 8204 states and 37628 transitions. [2020-10-11 15:13:23,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:23,872 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 37628 transitions. [2020-10-11 15:13:23,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:23,873 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:23,873 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:24,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:24,074 INFO L429 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-10-11 15:13:24,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:24,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1862834243, now seen corresponding path program 2 times [2020-10-11 15:13:24,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:24,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820006577] [2020-10-11 15:13:24,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:13:24,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820006577] [2020-10-11 15:13:24,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621412574] [2020-10-11 15:13:24,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:24,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:13:24,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:24,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:24,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:13:24,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:24,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:24,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381486482] [2020-10-11 15:13:24,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:24,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:24,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:24,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:24,226 INFO L87 Difference]: Start difference. First operand 8204 states and 37628 transitions. Second operand 11 states. [2020-10-11 15:13:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:24,970 INFO L93 Difference]: Finished difference Result 26661 states and 100277 transitions. [2020-10-11 15:13:24,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:24,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:25,070 INFO L225 Difference]: With dead ends: 26661 [2020-10-11 15:13:25,070 INFO L226 Difference]: Without dead ends: 26645 [2020-10-11 15:13:25,073 INFO L673 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-10-11 15:13:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26645 states. [2020-10-11 15:13:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26645 to 8091. [2020-10-11 15:13:25,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8091 states. [2020-10-11 15:13:25,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 37076 transitions. [2020-10-11 15:13:25,738 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 37076 transitions. Word has length 21 [2020-10-11 15:13:25,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:25,738 INFO L481 AbstractCegarLoop]: Abstraction has 8091 states and 37076 transitions. [2020-10-11 15:13:25,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:25,738 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 37076 transitions. [2020-10-11 15:13:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:25,739 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:25,740 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:25,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2020-10-11 15:13:25,952 INFO L429 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-10-11 15:13:25,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:25,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1769991039, now seen corresponding path program 3 times [2020-10-11 15:13:25,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:25,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640039109] [2020-10-11 15:13:25,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:26,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640039109] [2020-10-11 15:13:26,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198710031] [2020-10-11 15:13:26,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:26,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:13:26,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:26,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:26,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:26,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:26,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:26,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714775156] [2020-10-11 15:13:26,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:26,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:26,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:26,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:26,127 INFO L87 Difference]: Start difference. First operand 8091 states and 37076 transitions. Second operand 11 states. [2020-10-11 15:13:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:26,880 INFO L93 Difference]: Finished difference Result 26686 states and 100402 transitions. [2020-10-11 15:13:26,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:26,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:26,940 INFO L225 Difference]: With dead ends: 26686 [2020-10-11 15:13:26,940 INFO L226 Difference]: Without dead ends: 26674 [2020-10-11 15:13:26,941 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26674 states. [2020-10-11 15:13:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26674 to 7861. [2020-10-11 15:13:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2020-10-11 15:13:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 36066 transitions. [2020-10-11 15:13:27,306 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 36066 transitions. Word has length 21 [2020-10-11 15:13:27,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:27,307 INFO L481 AbstractCegarLoop]: Abstraction has 7861 states and 36066 transitions. [2020-10-11 15:13:27,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:27,307 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 36066 transitions. [2020-10-11 15:13:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:27,308 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:27,308 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:27,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:27,509 INFO L429 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-10-11 15:13:27,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:27,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1763681919, now seen corresponding path program 4 times [2020-10-11 15:13:27,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:27,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811660358] [2020-10-11 15:13:27,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:27,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811660358] [2020-10-11 15:13:27,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714507390] [2020-10-11 15:13:27,566 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:27,635 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:13:27,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:27,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:27,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:27,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:27,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:27,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363063977] [2020-10-11 15:13:27,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:27,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:27,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:27,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:27,665 INFO L87 Difference]: Start difference. First operand 7861 states and 36066 transitions. Second operand 11 states. [2020-10-11 15:13:28,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:28,277 INFO L93 Difference]: Finished difference Result 26489 states and 99650 transitions. [2020-10-11 15:13:28,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:28,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:28,337 INFO L225 Difference]: With dead ends: 26489 [2020-10-11 15:13:28,337 INFO L226 Difference]: Without dead ends: 26473 [2020-10-11 15:13:28,337 INFO L673 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-10-11 15:13:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26473 states. [2020-10-11 15:13:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26473 to 7748. [2020-10-11 15:13:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7748 states. [2020-10-11 15:13:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7748 states to 7748 states and 35514 transitions. [2020-10-11 15:13:28,696 INFO L78 Accepts]: Start accepts. Automaton has 7748 states and 35514 transitions. Word has length 21 [2020-10-11 15:13:28,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:28,696 INFO L481 AbstractCegarLoop]: Abstraction has 7748 states and 35514 transitions. [2020-10-11 15:13:28,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 7748 states and 35514 transitions. [2020-10-11 15:13:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:28,697 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:28,697 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:28,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-10-11 15:13:28,911 INFO L429 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-10-11 15:13:28,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:28,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1774143127, now seen corresponding path program 1 times [2020-10-11 15:13:28,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:28,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092938235] [2020-10-11 15:13:28,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:13:28,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092938235] [2020-10-11 15:13:28,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:28,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:28,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306265566] [2020-10-11 15:13:28,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:28,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:28,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:28,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:28,938 INFO L87 Difference]: Start difference. First operand 7748 states and 35514 transitions. Second operand 5 states. [2020-10-11 15:13:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:29,081 INFO L93 Difference]: Finished difference Result 13251 states and 57501 transitions. [2020-10-11 15:13:29,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:29,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-11 15:13:29,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:29,140 INFO L225 Difference]: With dead ends: 13251 [2020-10-11 15:13:29,140 INFO L226 Difference]: Without dead ends: 13220 [2020-10-11 15:13:29,141 INFO L673 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-10-11 15:13:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13220 states. [2020-10-11 15:13:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13220 to 9255. [2020-10-11 15:13:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9255 states. [2020-10-11 15:13:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9255 states to 9255 states and 42368 transitions. [2020-10-11 15:13:29,844 INFO L78 Accepts]: Start accepts. Automaton has 9255 states and 42368 transitions. Word has length 21 [2020-10-11 15:13:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:29,844 INFO L481 AbstractCegarLoop]: Abstraction has 9255 states and 42368 transitions. [2020-10-11 15:13:29,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 9255 states and 42368 transitions. [2020-10-11 15:13:29,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:29,846 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:29,846 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:29,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-11 15:13:29,846 INFO L429 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-10-11 15:13:29,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:29,847 INFO L82 PathProgramCache]: Analyzing trace with hash -628636285, now seen corresponding path program 5 times [2020-10-11 15:13:29,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:29,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438855222] [2020-10-11 15:13:29,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:29,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438855222] [2020-10-11 15:13:29,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:29,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:13:29,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129591969] [2020-10-11 15:13:29,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:29,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:29,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:29,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:29,892 INFO L87 Difference]: Start difference. First operand 9255 states and 42368 transitions. Second operand 9 states. [2020-10-11 15:13:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:30,477 INFO L93 Difference]: Finished difference Result 29788 states and 113841 transitions. [2020-10-11 15:13:30,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:30,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:13:30,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:30,543 INFO L225 Difference]: With dead ends: 29788 [2020-10-11 15:13:30,543 INFO L226 Difference]: Without dead ends: 29770 [2020-10-11 15:13:30,544 INFO L673 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-10-11 15:13:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2020-10-11 15:13:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 8964. [2020-10-11 15:13:30,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2020-10-11 15:13:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 41031 transitions. [2020-10-11 15:13:30,977 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 41031 transitions. Word has length 21 [2020-10-11 15:13:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:30,977 INFO L481 AbstractCegarLoop]: Abstraction has 8964 states and 41031 transitions. [2020-10-11 15:13:30,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 41031 transitions. [2020-10-11 15:13:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:30,978 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:30,978 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:30,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-10-11 15:13:30,979 INFO L429 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-10-11 15:13:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash -643099645, now seen corresponding path program 6 times [2020-10-11 15:13:30,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:30,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664517039] [2020-10-11 15:13:30,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:31,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664517039] [2020-10-11 15:13:31,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:31,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:13:31,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330702208] [2020-10-11 15:13:31,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:31,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:31,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:31,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:31,036 INFO L87 Difference]: Start difference. First operand 8964 states and 41031 transitions. Second operand 9 states. [2020-10-11 15:13:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:31,703 INFO L93 Difference]: Finished difference Result 29379 states and 112099 transitions. [2020-10-11 15:13:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:31,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:13:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:31,765 INFO L225 Difference]: With dead ends: 29379 [2020-10-11 15:13:31,765 INFO L226 Difference]: Without dead ends: 29356 [2020-10-11 15:13:31,766 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:13:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29356 states. [2020-10-11 15:13:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29356 to 8573. [2020-10-11 15:13:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8573 states. [2020-10-11 15:13:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8573 states to 8573 states and 39353 transitions. [2020-10-11 15:13:32,205 INFO L78 Accepts]: Start accepts. Automaton has 8573 states and 39353 transitions. Word has length 21 [2020-10-11 15:13:32,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:32,205 INFO L481 AbstractCegarLoop]: Abstraction has 8573 states and 39353 transitions. [2020-10-11 15:13:32,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 8573 states and 39353 transitions. [2020-10-11 15:13:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:13:32,207 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:32,207 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:32,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-10-11 15:13:32,208 INFO L429 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-10-11 15:13:32,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:32,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1599602836, now seen corresponding path program 1 times [2020-10-11 15:13:32,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:32,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033090391] [2020-10-11 15:13:32,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:13:32,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033090391] [2020-10-11 15:13:32,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187243901] [2020-10-11 15:13:32,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:32,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:32,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:13:32,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:32,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:32,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100791412] [2020-10-11 15:13:32,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:32,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:32,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:32,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:32,349 INFO L87 Difference]: Start difference. First operand 8573 states and 39353 transitions. Second operand 9 states. [2020-10-11 15:13:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:32,793 INFO L93 Difference]: Finished difference Result 19727 states and 80274 transitions. [2020-10-11 15:13:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:32,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-11 15:13:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:32,838 INFO L225 Difference]: With dead ends: 19727 [2020-10-11 15:13:32,838 INFO L226 Difference]: Without dead ends: 19703 [2020-10-11 15:13:32,839 INFO L673 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-10-11 15:13:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19703 states. [2020-10-11 15:13:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19703 to 8847. [2020-10-11 15:13:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2020-10-11 15:13:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40495 transitions. [2020-10-11 15:13:33,148 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40495 transitions. Word has length 23 [2020-10-11 15:13:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:33,148 INFO L481 AbstractCegarLoop]: Abstraction has 8847 states and 40495 transitions. [2020-10-11 15:13:33,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40495 transitions. [2020-10-11 15:13:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:13:33,150 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:33,150 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:33,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-10-11 15:13:33,361 INFO L429 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-10-11 15:13:33,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:33,362 INFO L82 PathProgramCache]: Analyzing trace with hash 72758744, now seen corresponding path program 1 times [2020-10-11 15:13:33,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:33,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509760267] [2020-10-11 15:13:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:33,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509760267] [2020-10-11 15:13:33,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042594807] [2020-10-11 15:13:33,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:33,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:33,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:33,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:33,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:33,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240360817] [2020-10-11 15:13:33,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:33,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:33,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:33,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:33,498 INFO L87 Difference]: Start difference. First operand 8847 states and 40495 transitions. Second operand 9 states. [2020-10-11 15:13:33,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:33,784 INFO L93 Difference]: Finished difference Result 20694 states and 84261 transitions. [2020-10-11 15:13:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:33,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-11 15:13:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:33,832 INFO L225 Difference]: With dead ends: 20694 [2020-10-11 15:13:33,832 INFO L226 Difference]: Without dead ends: 20666 [2020-10-11 15:13:33,832 INFO L673 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-10-11 15:13:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20666 states. [2020-10-11 15:13:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20666 to 9115. [2020-10-11 15:13:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9115 states. [2020-10-11 15:13:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 41679 transitions. [2020-10-11 15:13:34,175 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 41679 transitions. Word has length 23 [2020-10-11 15:13:34,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:34,175 INFO L481 AbstractCegarLoop]: Abstraction has 9115 states and 41679 transitions. [2020-10-11 15:13:34,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 41679 transitions. [2020-10-11 15:13:34,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:13:34,177 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:34,177 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:34,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:34,378 INFO L429 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-10-11 15:13:34,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:34,379 INFO L82 PathProgramCache]: Analyzing trace with hash -328675496, now seen corresponding path program 1 times [2020-10-11 15:13:34,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:34,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322074386] [2020-10-11 15:13:34,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:34,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322074386] [2020-10-11 15:13:34,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169620970] [2020-10-11 15:13:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:34,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:34,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:34,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:34,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:34,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887196742] [2020-10-11 15:13:34,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:34,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:34,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:34,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:34,501 INFO L87 Difference]: Start difference. First operand 9115 states and 41679 transitions. Second operand 9 states. [2020-10-11 15:13:34,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:34,800 INFO L93 Difference]: Finished difference Result 21396 states and 87360 transitions. [2020-10-11 15:13:34,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:34,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-11 15:13:34,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:34,851 INFO L225 Difference]: With dead ends: 21396 [2020-10-11 15:13:34,851 INFO L226 Difference]: Without dead ends: 21359 [2020-10-11 15:13:34,852 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:34,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21359 states. [2020-10-11 15:13:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21359 to 9320. [2020-10-11 15:13:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9320 states. [2020-10-11 15:13:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9320 states to 9320 states and 42648 transitions. [2020-10-11 15:13:35,183 INFO L78 Accepts]: Start accepts. Automaton has 9320 states and 42648 transitions. Word has length 23 [2020-10-11 15:13:35,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:35,183 INFO L481 AbstractCegarLoop]: Abstraction has 9320 states and 42648 transitions. [2020-10-11 15:13:35,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 9320 states and 42648 transitions. [2020-10-11 15:13:35,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:13:35,186 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:35,186 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:35,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2020-10-11 15:13:35,394 INFO L429 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-10-11 15:13:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:35,394 INFO L82 PathProgramCache]: Analyzing trace with hash -150456492, now seen corresponding path program 2 times [2020-10-11 15:13:35,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:35,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409000711] [2020-10-11 15:13:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:13:35,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409000711] [2020-10-11 15:13:35,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:35,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:35,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263945058] [2020-10-11 15:13:35,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:35,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:35,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:35,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:35,427 INFO L87 Difference]: Start difference. First operand 9320 states and 42648 transitions. Second operand 7 states. [2020-10-11 15:13:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:35,688 INFO L93 Difference]: Finished difference Result 21489 states and 87752 transitions. [2020-10-11 15:13:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:35,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-11 15:13:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:35,735 INFO L225 Difference]: With dead ends: 21489 [2020-10-11 15:13:35,735 INFO L226 Difference]: Without dead ends: 21452 [2020-10-11 15:13:35,735 INFO L673 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-10-11 15:13:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2020-10-11 15:13:36,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 9401. [2020-10-11 15:13:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9401 states. [2020-10-11 15:13:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9401 states to 9401 states and 43010 transitions. [2020-10-11 15:13:36,236 INFO L78 Accepts]: Start accepts. Automaton has 9401 states and 43010 transitions. Word has length 23 [2020-10-11 15:13:36,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:36,236 INFO L481 AbstractCegarLoop]: Abstraction has 9401 states and 43010 transitions. [2020-10-11 15:13:36,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 9401 states and 43010 transitions. [2020-10-11 15:13:36,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:13:36,239 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:36,239 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:36,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-10-11 15:13:36,239 INFO L429 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-10-11 15:13:36,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:36,239 INFO L82 PathProgramCache]: Analyzing trace with hash -150471558, now seen corresponding path program 2 times [2020-10-11 15:13:36,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:36,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350678786] [2020-10-11 15:13:36,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:13:36,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350678786] [2020-10-11 15:13:36,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:36,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:36,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448471281] [2020-10-11 15:13:36,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:36,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:36,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:36,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:36,275 INFO L87 Difference]: Start difference. First operand 9401 states and 43010 transitions. Second operand 7 states. [2020-10-11 15:13:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:36,555 INFO L93 Difference]: Finished difference Result 21218 states and 86469 transitions. [2020-10-11 15:13:36,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:36,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-11 15:13:36,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:36,604 INFO L225 Difference]: With dead ends: 21218 [2020-10-11 15:13:36,604 INFO L226 Difference]: Without dead ends: 21181 [2020-10-11 15:13:36,604 INFO L673 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-10-11 15:13:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21181 states. [2020-10-11 15:13:36,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21181 to 9396. [2020-10-11 15:13:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9396 states. [2020-10-11 15:13:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9396 states to 9396 states and 42985 transitions. [2020-10-11 15:13:36,950 INFO L78 Accepts]: Start accepts. Automaton has 9396 states and 42985 transitions. Word has length 23 [2020-10-11 15:13:36,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:36,950 INFO L481 AbstractCegarLoop]: Abstraction has 9396 states and 42985 transitions. [2020-10-11 15:13:36,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 9396 states and 42985 transitions. [2020-10-11 15:13:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:13:36,952 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:36,953 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:36,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-10-11 15:13:36,953 INFO L429 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-10-11 15:13:36,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:36,953 INFO L82 PathProgramCache]: Analyzing trace with hash -150449920, now seen corresponding path program 2 times [2020-10-11 15:13:36,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:36,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131805899] [2020-10-11 15:13:36,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:13:36,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131805899] [2020-10-11 15:13:36,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:36,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:36,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184299408] [2020-10-11 15:13:36,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:36,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:36,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:36,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:36,991 INFO L87 Difference]: Start difference. First operand 9396 states and 42985 transitions. Second operand 7 states. [2020-10-11 15:13:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:37,274 INFO L93 Difference]: Finished difference Result 21047 states and 85702 transitions. [2020-10-11 15:13:37,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:37,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-11 15:13:37,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:37,325 INFO L225 Difference]: With dead ends: 21047 [2020-10-11 15:13:37,326 INFO L226 Difference]: Without dead ends: 21010 [2020-10-11 15:13:37,326 INFO L673 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-10-11 15:13:37,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21010 states. [2020-10-11 15:13:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21010 to 9426. [2020-10-11 15:13:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9426 states. [2020-10-11 15:13:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 43057 transitions. [2020-10-11 15:13:37,656 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 43057 transitions. Word has length 23 [2020-10-11 15:13:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:37,656 INFO L481 AbstractCegarLoop]: Abstraction has 9426 states and 43057 transitions. [2020-10-11 15:13:37,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 43057 transitions. [2020-10-11 15:13:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:37,659 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:37,659 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:37,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-10-11 15:13:37,660 INFO L429 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-10-11 15:13:37,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:37,660 INFO L82 PathProgramCache]: Analyzing trace with hash -156736363, now seen corresponding path program 1 times [2020-10-11 15:13:37,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:37,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428727658] [2020-10-11 15:13:37,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:13:37,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428727658] [2020-10-11 15:13:37,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433387756] [2020-10-11 15:13:37,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:37,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:37,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:13:37,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:37,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:37,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315793312] [2020-10-11 15:13:37,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:37,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:37,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:37,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:37,802 INFO L87 Difference]: Start difference. First operand 9426 states and 43057 transitions. Second operand 11 states. [2020-10-11 15:13:38,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:38,504 INFO L93 Difference]: Finished difference Result 30145 states and 115754 transitions. [2020-10-11 15:13:38,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:38,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:38,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:38,568 INFO L225 Difference]: With dead ends: 30145 [2020-10-11 15:13:38,568 INFO L226 Difference]: Without dead ends: 30125 [2020-10-11 15:13:38,568 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30125 states. [2020-10-11 15:13:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30125 to 9338. [2020-10-11 15:13:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9338 states. [2020-10-11 15:13:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9338 states to 9338 states and 42582 transitions. [2020-10-11 15:13:39,025 INFO L78 Accepts]: Start accepts. Automaton has 9338 states and 42582 transitions. Word has length 25 [2020-10-11 15:13:39,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:39,025 INFO L481 AbstractCegarLoop]: Abstraction has 9338 states and 42582 transitions. [2020-10-11 15:13:39,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 9338 states and 42582 transitions. [2020-10-11 15:13:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:39,028 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:39,028 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:39,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-10-11 15:13:39,229 INFO L429 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-10-11 15:13:39,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:39,230 INFO L82 PathProgramCache]: Analyzing trace with hash -558170603, now seen corresponding path program 1 times [2020-10-11 15:13:39,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:39,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027813553] [2020-10-11 15:13:39,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:39,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027813553] [2020-10-11 15:13:39,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444028492] [2020-10-11 15:13:39,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:39,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:39,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:39,531 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:39,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:39,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:39,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079401335] [2020-10-11 15:13:39,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:39,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:39,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:39,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:39,532 INFO L87 Difference]: Start difference. First operand 9338 states and 42582 transitions. Second operand 11 states. [2020-10-11 15:13:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:40,214 INFO L93 Difference]: Finished difference Result 29696 states and 113916 transitions. [2020-10-11 15:13:40,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:40,214 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:40,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:40,276 INFO L225 Difference]: With dead ends: 29696 [2020-10-11 15:13:40,277 INFO L226 Difference]: Without dead ends: 29676 [2020-10-11 15:13:40,277 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29676 states. [2020-10-11 15:13:40,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29676 to 9291. [2020-10-11 15:13:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9291 states. [2020-10-11 15:13:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 42295 transitions. [2020-10-11 15:13:40,694 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 42295 transitions. Word has length 25 [2020-10-11 15:13:40,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:40,694 INFO L481 AbstractCegarLoop]: Abstraction has 9291 states and 42295 transitions. [2020-10-11 15:13:40,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 42295 transitions. [2020-10-11 15:13:40,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:40,698 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:40,698 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:40,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2020-10-11 15:13:40,899 INFO L429 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-10-11 15:13:40,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:40,899 INFO L82 PathProgramCache]: Analyzing trace with hash -379966665, now seen corresponding path program 2 times [2020-10-11 15:13:40,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:40,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097781748] [2020-10-11 15:13:40,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:40,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:13:40,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097781748] [2020-10-11 15:13:40,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005755611] [2020-10-11 15:13:40,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:41,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:13:41,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:41,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:41,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:13:41,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:41,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:41,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591077613] [2020-10-11 15:13:41,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:41,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:41,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:41,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:41,044 INFO L87 Difference]: Start difference. First operand 9291 states and 42295 transitions. Second operand 11 states. [2020-10-11 15:13:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:41,667 INFO L93 Difference]: Finished difference Result 29267 states and 112142 transitions. [2020-10-11 15:13:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:41,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:41,728 INFO L225 Difference]: With dead ends: 29267 [2020-10-11 15:13:41,729 INFO L226 Difference]: Without dead ends: 29245 [2020-10-11 15:13:41,729 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2020-10-11 15:13:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 9288. [2020-10-11 15:13:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9288 states. [2020-10-11 15:13:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 42242 transitions. [2020-10-11 15:13:42,155 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 42242 transitions. Word has length 25 [2020-10-11 15:13:42,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:42,155 INFO L481 AbstractCegarLoop]: Abstraction has 9288 states and 42242 transitions. [2020-10-11 15:13:42,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:42,155 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 42242 transitions. [2020-10-11 15:13:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:42,158 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:42,158 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:42,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2020-10-11 15:13:42,359 INFO L429 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-10-11 15:13:42,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:42,360 INFO L82 PathProgramCache]: Analyzing trace with hash -379945027, now seen corresponding path program 2 times [2020-10-11 15:13:42,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:42,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154419357] [2020-10-11 15:13:42,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:13:42,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154419357] [2020-10-11 15:13:42,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663382148] [2020-10-11 15:13:42,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:42,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:13:42,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:42,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:42,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:13:42,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:42,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:42,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186986557] [2020-10-11 15:13:42,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:42,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:42,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:42,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:42,507 INFO L87 Difference]: Start difference. First operand 9288 states and 42242 transitions. Second operand 11 states. [2020-10-11 15:13:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:43,162 INFO L93 Difference]: Finished difference Result 28920 states and 110796 transitions. [2020-10-11 15:13:43,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:43,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:43,222 INFO L225 Difference]: With dead ends: 28920 [2020-10-11 15:13:43,222 INFO L226 Difference]: Without dead ends: 28898 [2020-10-11 15:13:43,223 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:43,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28898 states. [2020-10-11 15:13:43,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28898 to 9176. [2020-10-11 15:13:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2020-10-11 15:13:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 41695 transitions. [2020-10-11 15:13:43,843 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 41695 transitions. Word has length 25 [2020-10-11 15:13:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:43,843 INFO L481 AbstractCegarLoop]: Abstraction has 9176 states and 41695 transitions. [2020-10-11 15:13:43,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 41695 transitions. [2020-10-11 15:13:43,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:43,847 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:43,847 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:44,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:44,048 INFO L429 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-10-11 15:13:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:44,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1211690581, now seen corresponding path program 3 times [2020-10-11 15:13:44,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:44,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108637063] [2020-10-11 15:13:44,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:44,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108637063] [2020-10-11 15:13:44,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838071499] [2020-10-11 15:13:44,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:44,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-11 15:13:44,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:44,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:44,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:44,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:44,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:44,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166460990] [2020-10-11 15:13:44,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:44,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:44,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:44,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:44,188 INFO L87 Difference]: Start difference. First operand 9176 states and 41695 transitions. Second operand 11 states. [2020-10-11 15:13:44,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:44,813 INFO L93 Difference]: Finished difference Result 29038 states and 111216 transitions. [2020-10-11 15:13:44,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:44,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:44,874 INFO L225 Difference]: With dead ends: 29038 [2020-10-11 15:13:44,874 INFO L226 Difference]: Without dead ends: 29018 [2020-10-11 15:13:44,874 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29018 states. [2020-10-11 15:13:45,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29018 to 9000. [2020-10-11 15:13:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9000 states. [2020-10-11 15:13:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9000 states to 9000 states and 40897 transitions. [2020-10-11 15:13:45,282 INFO L78 Accepts]: Start accepts. Automaton has 9000 states and 40897 transitions. Word has length 25 [2020-10-11 15:13:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:45,282 INFO L481 AbstractCegarLoop]: Abstraction has 9000 states and 40897 transitions. [2020-10-11 15:13:45,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 9000 states and 40897 transitions. [2020-10-11 15:13:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:45,285 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:45,285 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:45,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-10-11 15:13:45,486 INFO L429 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-10-11 15:13:45,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:45,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1201691221, now seen corresponding path program 4 times [2020-10-11 15:13:45,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:45,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453087066] [2020-10-11 15:13:45,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:45,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453087066] [2020-10-11 15:13:45,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473169971] [2020-10-11 15:13:45,534 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:45,610 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:13:45,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:45,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:45,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:45,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:45,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:45,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872156032] [2020-10-11 15:13:45,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:45,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:45,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:45,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:45,632 INFO L87 Difference]: Start difference. First operand 9000 states and 40897 transitions. Second operand 11 states. [2020-10-11 15:13:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:46,327 INFO L93 Difference]: Finished difference Result 29283 states and 112236 transitions. [2020-10-11 15:13:46,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:46,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:46,390 INFO L225 Difference]: With dead ends: 29283 [2020-10-11 15:13:46,391 INFO L226 Difference]: Without dead ends: 29261 [2020-10-11 15:13:46,391 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:46,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29261 states. [2020-10-11 15:13:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29261 to 8997. [2020-10-11 15:13:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8997 states. [2020-10-11 15:13:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8997 states to 8997 states and 40842 transitions. [2020-10-11 15:13:46,806 INFO L78 Accepts]: Start accepts. Automaton has 8997 states and 40842 transitions. Word has length 25 [2020-10-11 15:13:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:46,806 INFO L481 AbstractCegarLoop]: Abstraction has 8997 states and 40842 transitions. [2020-10-11 15:13:46,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 8997 states and 40842 transitions. [2020-10-11 15:13:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:46,809 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:46,809 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:47,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:47,010 INFO L429 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-10-11 15:13:47,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:47,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1201697793, now seen corresponding path program 1 times [2020-10-11 15:13:47,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:47,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416015467] [2020-10-11 15:13:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:47,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416015467] [2020-10-11 15:13:47,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778226709] [2020-10-11 15:13:47,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:47,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:47,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:47,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:47,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:47,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484327429] [2020-10-11 15:13:47,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:47,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:47,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:47,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:47,161 INFO L87 Difference]: Start difference. First operand 8997 states and 40842 transitions. Second operand 11 states. [2020-10-11 15:13:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:47,866 INFO L93 Difference]: Finished difference Result 29105 states and 111801 transitions. [2020-10-11 15:13:47,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:47,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:47,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:47,928 INFO L225 Difference]: With dead ends: 29105 [2020-10-11 15:13:47,928 INFO L226 Difference]: Without dead ends: 29085 [2020-10-11 15:13:47,928 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29085 states. [2020-10-11 15:13:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29085 to 8955. [2020-10-11 15:13:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8955 states. [2020-10-11 15:13:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8955 states to 8955 states and 40593 transitions. [2020-10-11 15:13:48,344 INFO L78 Accepts]: Start accepts. Automaton has 8955 states and 40593 transitions. Word has length 25 [2020-10-11 15:13:48,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:48,345 INFO L481 AbstractCegarLoop]: Abstraction has 8955 states and 40593 transitions. [2020-10-11 15:13:48,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 8955 states and 40593 transitions. [2020-10-11 15:13:48,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:48,349 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:48,349 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:48,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2020-10-11 15:13:48,550 INFO L429 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-10-11 15:13:48,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:48,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1218006273, now seen corresponding path program 2 times [2020-10-11 15:13:48,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:48,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699806942] [2020-10-11 15:13:48,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:48,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699806942] [2020-10-11 15:13:48,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354626530] [2020-10-11 15:13:48,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:48,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:13:48,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:48,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:48,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:48,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:48,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:48,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474544704] [2020-10-11 15:13:48,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:48,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:48,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:48,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:48,717 INFO L87 Difference]: Start difference. First operand 8955 states and 40593 transitions. Second operand 11 states. [2020-10-11 15:13:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:49,815 INFO L93 Difference]: Finished difference Result 28806 states and 110558 transitions. [2020-10-11 15:13:49,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:49,816 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:49,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:49,936 INFO L225 Difference]: With dead ends: 28806 [2020-10-11 15:13:49,936 INFO L226 Difference]: Without dead ends: 28779 [2020-10-11 15:13:49,937 INFO L673 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-10-11 15:13:50,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28779 states. [2020-10-11 15:13:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28779 to 8841. [2020-10-11 15:13:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8841 states. [2020-10-11 15:13:50,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 40062 transitions. [2020-10-11 15:13:50,715 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 40062 transitions. Word has length 25 [2020-10-11 15:13:50,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:50,715 INFO L481 AbstractCegarLoop]: Abstraction has 8841 states and 40062 transitions. [2020-10-11 15:13:50,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 40062 transitions. [2020-10-11 15:13:50,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:50,719 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:50,720 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:50,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:50,932 INFO L429 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-10-11 15:13:50,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:50,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1980442581, now seen corresponding path program 3 times [2020-10-11 15:13:50,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:50,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466832624] [2020-10-11 15:13:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:50,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466832624] [2020-10-11 15:13:50,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54091005] [2020-10-11 15:13:50,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:51,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:13:51,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:51,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:51,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:51,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:51,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:51,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112447940] [2020-10-11 15:13:51,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:51,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:51,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:51,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:51,075 INFO L87 Difference]: Start difference. First operand 8841 states and 40062 transitions. Second operand 11 states. [2020-10-11 15:13:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:51,785 INFO L93 Difference]: Finished difference Result 28636 states and 109852 transitions. [2020-10-11 15:13:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:51,785 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:51,845 INFO L225 Difference]: With dead ends: 28636 [2020-10-11 15:13:51,845 INFO L226 Difference]: Without dead ends: 28616 [2020-10-11 15:13:51,846 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:51,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28616 states. [2020-10-11 15:13:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28616 to 8702. [2020-10-11 15:13:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8702 states. [2020-10-11 15:13:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8702 states to 8702 states and 39438 transitions. [2020-10-11 15:13:52,230 INFO L78 Accepts]: Start accepts. Automaton has 8702 states and 39438 transitions. Word has length 25 [2020-10-11 15:13:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:52,230 INFO L481 AbstractCegarLoop]: Abstraction has 8702 states and 39438 transitions. [2020-10-11 15:13:52,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:52,230 INFO L276 IsEmpty]: Start isEmpty. Operand 8702 states and 39438 transitions. [2020-10-11 15:13:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:52,233 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:52,233 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:52,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2020-10-11 15:13:52,434 INFO L429 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-10-11 15:13:52,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:52,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1965964155, now seen corresponding path program 3 times [2020-10-11 15:13:52,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:52,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035175621] [2020-10-11 15:13:52,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:52,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035175621] [2020-10-11 15:13:52,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036294935] [2020-10-11 15:13:52,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:52,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:13:52,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:52,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:52,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:52,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:52,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:52,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140339571] [2020-10-11 15:13:52,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:52,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:52,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:52,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:52,578 INFO L87 Difference]: Start difference. First operand 8702 states and 39438 transitions. Second operand 11 states. [2020-10-11 15:13:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:53,229 INFO L93 Difference]: Finished difference Result 28297 states and 108461 transitions. [2020-10-11 15:13:53,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:53,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:53,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:53,290 INFO L225 Difference]: With dead ends: 28297 [2020-10-11 15:13:53,290 INFO L226 Difference]: Without dead ends: 28277 [2020-10-11 15:13:53,290 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:53,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28277 states. [2020-10-11 15:13:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28277 to 8596. [2020-10-11 15:13:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8596 states. [2020-10-11 15:13:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 38978 transitions. [2020-10-11 15:13:53,676 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 38978 transitions. Word has length 25 [2020-10-11 15:13:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:53,676 INFO L481 AbstractCegarLoop]: Abstraction has 8596 states and 38978 transitions. [2020-10-11 15:13:53,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 38978 transitions. [2020-10-11 15:13:53,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:53,679 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:53,679 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:53,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:53,880 INFO L429 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-10-11 15:13:53,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:53,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1970443221, now seen corresponding path program 4 times [2020-10-11 15:13:53,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:53,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173132873] [2020-10-11 15:13:53,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:53,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173132873] [2020-10-11 15:13:53,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242249755] [2020-10-11 15:13:53,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:54,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:13:54,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:54,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:54,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:54,034 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:54,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:54,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:54,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096551914] [2020-10-11 15:13:54,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:54,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:54,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:54,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:54,036 INFO L87 Difference]: Start difference. First operand 8596 states and 38978 transitions. Second operand 11 states. [2020-10-11 15:13:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:54,718 INFO L93 Difference]: Finished difference Result 28565 states and 109596 transitions. [2020-10-11 15:13:54,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:54,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:54,781 INFO L225 Difference]: With dead ends: 28565 [2020-10-11 15:13:54,781 INFO L226 Difference]: Without dead ends: 28538 [2020-10-11 15:13:54,781 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2020-10-11 15:13:55,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8563. [2020-10-11 15:13:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8563 states. [2020-10-11 15:13:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 38809 transitions. [2020-10-11 15:13:55,317 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 38809 transitions. Word has length 25 [2020-10-11 15:13:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:55,319 INFO L481 AbstractCegarLoop]: Abstraction has 8563 states and 38809 transitions. [2020-10-11 15:13:55,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:55,319 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 38809 transitions. [2020-10-11 15:13:55,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:55,322 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:55,322 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:55,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2020-10-11 15:13:55,529 INFO L429 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-10-11 15:13:55,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:55,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1970428155, now seen corresponding path program 4 times [2020-10-11 15:13:55,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:55,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669131428] [2020-10-11 15:13:55,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:55,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669131428] [2020-10-11 15:13:55,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183153503] [2020-10-11 15:13:55,575 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/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-10-11 15:13:55,650 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:13:55,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:55,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:55,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:55,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:55,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:55,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678358423] [2020-10-11 15:13:55,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:55,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:55,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:55,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:55,672 INFO L87 Difference]: Start difference. First operand 8563 states and 38809 transitions. Second operand 11 states. [2020-10-11 15:13:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:56,372 INFO L93 Difference]: Finished difference Result 28213 states and 108237 transitions. [2020-10-11 15:13:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:56,372 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:56,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:56,428 INFO L225 Difference]: With dead ends: 28213 [2020-10-11 15:13:56,428 INFO L226 Difference]: Without dead ends: 28186 [2020-10-11 15:13:56,428 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:56,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28186 states. [2020-10-11 15:13:56,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28186 to 8421. [2020-10-11 15:13:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8421 states. [2020-10-11 15:13:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8421 states to 8421 states and 38146 transitions. [2020-10-11 15:13:56,812 INFO L78 Accepts]: Start accepts. Automaton has 8421 states and 38146 transitions. Word has length 25 [2020-10-11 15:13:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:56,812 INFO L481 AbstractCegarLoop]: Abstraction has 8421 states and 38146 transitions. [2020-10-11 15:13:56,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 8421 states and 38146 transitions. [2020-10-11 15:13:56,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:56,815 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:56,815 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:57,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:57,016 INFO L429 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-10-11 15:13:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:57,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1943046054, now seen corresponding path program 1 times [2020-10-11 15:13:57,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:57,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663491850] [2020-10-11 15:13:57,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:13:57,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663491850] [2020-10-11 15:13:57,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:57,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:57,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201613066] [2020-10-11 15:13:57,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:57,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:57,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:57,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:57,041 INFO L87 Difference]: Start difference. First operand 8421 states and 38146 transitions. Second operand 5 states. [2020-10-11 15:13:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:57,215 INFO L93 Difference]: Finished difference Result 13647 states and 59401 transitions. [2020-10-11 15:13:57,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:57,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-10-11 15:13:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:57,276 INFO L225 Difference]: With dead ends: 13647 [2020-10-11 15:13:57,277 INFO L226 Difference]: Without dead ends: 13615 [2020-10-11 15:13:57,277 INFO L673 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-10-11 15:13:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13615 states. [2020-10-11 15:13:57,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13615 to 9928. [2020-10-11 15:13:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9928 states. [2020-10-11 15:13:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9928 states to 9928 states and 44651 transitions. [2020-10-11 15:13:57,836 INFO L78 Accepts]: Start accepts. Automaton has 9928 states and 44651 transitions. Word has length 25 [2020-10-11 15:13:57,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:57,837 INFO L481 AbstractCegarLoop]: Abstraction has 9928 states and 44651 transitions. [2020-10-11 15:13:57,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 9928 states and 44651 transitions. [2020-10-11 15:13:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:57,844 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:57,844 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:57,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-10-11 15:13:57,844 INFO L429 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-10-11 15:13:57,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:57,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1440199159, now seen corresponding path program 5 times [2020-10-11 15:13:57,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:57,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693819035] [2020-10-11 15:13:57,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:13:57,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693819035] [2020-10-11 15:13:57,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:57,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:13:57,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346199345] [2020-10-11 15:13:57,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:57,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:57,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:57,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:57,924 INFO L87 Difference]: Start difference. First operand 9928 states and 44651 transitions. Second operand 9 states. [2020-10-11 15:13:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:58,626 INFO L93 Difference]: Finished difference Result 31816 states and 123346 transitions. [2020-10-11 15:13:58,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:58,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:13:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:58,696 INFO L225 Difference]: With dead ends: 31816 [2020-10-11 15:13:58,697 INFO L226 Difference]: Without dead ends: 31790 [2020-10-11 15:13:58,697 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:13:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31790 states. [2020-10-11 15:13:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31790 to 9766. [2020-10-11 15:13:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9766 states. [2020-10-11 15:13:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 43873 transitions. [2020-10-11 15:13:59,164 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 43873 transitions. Word has length 25 [2020-10-11 15:13:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:59,164 INFO L481 AbstractCegarLoop]: Abstraction has 9766 states and 43873 transitions. [2020-10-11 15:13:59,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 43873 transitions. [2020-10-11 15:13:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:59,167 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:59,167 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:59,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-10-11 15:13:59,167 INFO L429 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-10-11 15:13:59,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:59,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1440220797, now seen corresponding path program 5 times [2020-10-11 15:13:59,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:59,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324475219] [2020-10-11 15:13:59,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:13:59,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324475219] [2020-10-11 15:13:59,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:59,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:13:59,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058499648] [2020-10-11 15:13:59,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:59,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:59,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:59,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:59,214 INFO L87 Difference]: Start difference. First operand 9766 states and 43873 transitions. Second operand 9 states. [2020-10-11 15:13:59,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:59,842 INFO L93 Difference]: Finished difference Result 31277 states and 121098 transitions. [2020-10-11 15:13:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:59,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:13:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:59,910 INFO L225 Difference]: With dead ends: 31277 [2020-10-11 15:13:59,910 INFO L226 Difference]: Without dead ends: 31251 [2020-10-11 15:13:59,911 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:14:00,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31251 states. [2020-10-11 15:14:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31251 to 9592. [2020-10-11 15:14:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9592 states. [2020-10-11 15:14:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9592 states to 9592 states and 43051 transitions. [2020-10-11 15:14:00,373 INFO L78 Accepts]: Start accepts. Automaton has 9592 states and 43051 transitions. Word has length 25 [2020-10-11 15:14:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:00,373 INFO L481 AbstractCegarLoop]: Abstraction has 9592 states and 43051 transitions. [2020-10-11 15:14:00,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 9592 states and 43051 transitions. [2020-10-11 15:14:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:14:00,377 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:00,377 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:00,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-10-11 15:14:00,377 INFO L429 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-10-11 15:14:00,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:00,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1425735799, now seen corresponding path program 6 times [2020-10-11 15:14:00,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:00,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407608576] [2020-10-11 15:14:00,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:14:00,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407608576] [2020-10-11 15:14:00,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:00,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:00,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633270494] [2020-10-11 15:14:00,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:00,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:00,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:00,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:00,432 INFO L87 Difference]: Start difference. First operand 9592 states and 43051 transitions. Second operand 9 states. [2020-10-11 15:14:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:01,584 INFO L93 Difference]: Finished difference Result 30952 states and 119650 transitions. [2020-10-11 15:14:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:01,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:14:01,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:01,695 INFO L225 Difference]: With dead ends: 30952 [2020-10-11 15:14:01,695 INFO L226 Difference]: Without dead ends: 30919 [2020-10-11 15:14:01,695 INFO L673 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-10-11 15:14:01,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30919 states. [2020-10-11 15:14:02,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30919 to 9246. [2020-10-11 15:14:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9246 states. [2020-10-11 15:14:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9246 states to 9246 states and 41509 transitions. [2020-10-11 15:14:02,239 INFO L78 Accepts]: Start accepts. Automaton has 9246 states and 41509 transitions. Word has length 25 [2020-10-11 15:14:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:02,239 INFO L481 AbstractCegarLoop]: Abstraction has 9246 states and 41509 transitions. [2020-10-11 15:14:02,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 9246 states and 41509 transitions. [2020-10-11 15:14:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:14:02,242 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:02,242 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:02,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-10-11 15:14:02,243 INFO L429 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-10-11 15:14:02,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:02,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1425742371, now seen corresponding path program 5 times [2020-10-11 15:14:02,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:02,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531200396] [2020-10-11 15:14:02,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:14:02,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531200396] [2020-10-11 15:14:02,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:02,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:02,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043021023] [2020-10-11 15:14:02,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:02,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:02,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:02,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:02,297 INFO L87 Difference]: Start difference. First operand 9246 states and 41509 transitions. Second operand 9 states. [2020-10-11 15:14:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:02,982 INFO L93 Difference]: Finished difference Result 30541 states and 117947 transitions. [2020-10-11 15:14:02,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:02,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:14:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:03,047 INFO L225 Difference]: With dead ends: 30541 [2020-10-11 15:14:03,048 INFO L226 Difference]: Without dead ends: 30515 [2020-10-11 15:14:03,048 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:14:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30515 states. [2020-10-11 15:14:03,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30515 to 9136. [2020-10-11 15:14:03,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9136 states. [2020-10-11 15:14:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9136 states to 9136 states and 40999 transitions. [2020-10-11 15:14:03,479 INFO L78 Accepts]: Start accepts. Automaton has 9136 states and 40999 transitions. Word has length 25 [2020-10-11 15:14:03,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:03,479 INFO L481 AbstractCegarLoop]: Abstraction has 9136 states and 40999 transitions. [2020-10-11 15:14:03,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 9136 states and 40999 transitions. [2020-10-11 15:14:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:14:03,482 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:03,482 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:03,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-10-11 15:14:03,482 INFO L429 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-10-11 15:14:03,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:03,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1446529917, now seen corresponding path program 6 times [2020-10-11 15:14:03,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:03,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700071299] [2020-10-11 15:14:03,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:14:03,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700071299] [2020-10-11 15:14:03,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:03,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:03,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20775187] [2020-10-11 15:14:03,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:03,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:03,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:03,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:03,531 INFO L87 Difference]: Start difference. First operand 9136 states and 40999 transitions. Second operand 9 states. [2020-10-11 15:14:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:04,205 INFO L93 Difference]: Finished difference Result 30263 states and 116773 transitions. [2020-10-11 15:14:04,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:04,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:14:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:04,268 INFO L225 Difference]: With dead ends: 30263 [2020-10-11 15:14:04,269 INFO L226 Difference]: Without dead ends: 30230 [2020-10-11 15:14:04,269 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:14:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30230 states. [2020-10-11 15:14:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30230 to 8877. [2020-10-11 15:14:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8877 states. [2020-10-11 15:14:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8877 states to 8877 states and 39872 transitions. [2020-10-11 15:14:04,698 INFO L78 Accepts]: Start accepts. Automaton has 8877 states and 39872 transitions. Word has length 25 [2020-10-11 15:14:04,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:04,698 INFO L481 AbstractCegarLoop]: Abstraction has 8877 states and 39872 transitions. [2020-10-11 15:14:04,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 8877 states and 39872 transitions. [2020-10-11 15:14:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:14:04,701 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:04,701 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:04,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-10-11 15:14:04,701 INFO L429 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-10-11 15:14:04,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:04,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1446514851, now seen corresponding path program 6 times [2020-10-11 15:14:04,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:04,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996252567] [2020-10-11 15:14:04,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:14:04,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996252567] [2020-10-11 15:14:04,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:04,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:04,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267936507] [2020-10-11 15:14:04,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:04,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:04,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:04,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:04,759 INFO L87 Difference]: Start difference. First operand 8877 states and 39872 transitions. Second operand 9 states. [2020-10-11 15:14:05,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:05,553 INFO L93 Difference]: Finished difference Result 29856 states and 115140 transitions. [2020-10-11 15:14:05,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:05,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:14:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:05,649 INFO L225 Difference]: With dead ends: 29856 [2020-10-11 15:14:05,649 INFO L226 Difference]: Without dead ends: 29823 [2020-10-11 15:14:05,649 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:14:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29823 states. [2020-10-11 15:14:06,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29823 to 8560. [2020-10-11 15:14:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8560 states. [2020-10-11 15:14:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 38495 transitions. [2020-10-11 15:14:06,058 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 38495 transitions. Word has length 25 [2020-10-11 15:14:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:06,059 INFO L481 AbstractCegarLoop]: Abstraction has 8560 states and 38495 transitions. [2020-10-11 15:14:06,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 38495 transitions. [2020-10-11 15:14:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-11 15:14:06,062 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:06,062 INFO L421 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:06,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-10-11 15:14:06,062 INFO L429 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-10-11 15:14:06,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:06,063 INFO L82 PathProgramCache]: Analyzing trace with hash -110415564, now seen corresponding path program 1 times [2020-10-11 15:14:06,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:06,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237022729] [2020-10-11 15:14:06,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:14:06,068 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:14:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:14:06,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:14:06,078 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:14:06,078 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:14:06,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-10-11 15:14:06,079 WARN L371 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-11 15:14:06,079 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-10-11 15:14:06,094 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,094 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,094 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,094 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,094 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,095 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,095 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,095 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,095 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,095 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,095 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,095 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,096 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,096 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,096 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,096 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,096 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,096 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,096 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,096 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,097 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,097 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,097 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,097 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,097 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,097 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,097 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,098 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,098 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,098 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,098 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,098 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,098 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,098 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,099 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,099 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,099 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,099 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,099 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,099 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,099 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,099 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,100 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,100 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,100 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,100 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,100 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,100 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,100 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,100 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,101 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,101 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,101 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,101 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,111 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,111 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,112 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,112 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,112 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,119 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,119 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,119 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,120 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,120 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,121 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,121 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,121 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,121 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,121 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,125 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,125 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,125 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,125 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,125 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,126 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,126 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,127 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,127 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,127 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,128 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,128 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,128 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,129 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,129 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,150 INFO L253 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-10-11 15:14:06,150 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:14:06,151 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:14:06,151 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:14:06,151 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:14:06,151 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:14:06,151 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:14:06,151 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:14:06,151 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:14:06,153 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:14:06,153 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 141 transitions, 402 flow [2020-10-11 15:14:06,153 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 141 transitions, 402 flow [2020-10-11 15:14:06,153 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions, 402 flow [2020-10-11 15:14:06,174 INFO L129 PetriNetUnfolder]: 8/171 cut-off events. [2020-10-11 15:14:06,174 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-11 15:14:06,176 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-10-11 15:14:06,183 INFO L117 LiptonReduction]: Number of co-enabled transitions 3612 [2020-10-11 15:14:07,977 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-10-11 15:14:08,227 INFO L132 LiptonReduction]: Checked pairs total: 5372 [2020-10-11 15:14:08,227 INFO L134 LiptonReduction]: Total number of compositions: 134 [2020-10-11 15:14:08,228 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 45 transitions, 210 flow [2020-10-11 15:14:09,625 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2020-10-11 15:14:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2020-10-11 15:14:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:14:09,626 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:09,626 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:14:09,626 INFO L429 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-10-11 15:14:09,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:09,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1291919, now seen corresponding path program 1 times [2020-10-11 15:14:09,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:09,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515270430] [2020-10-11 15:14:09,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:14:09,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515270430] [2020-10-11 15:14:09,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:09,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:14:09,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220390934] [2020-10-11 15:14:09,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:14:09,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:09,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:14:09,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:14:09,634 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2020-10-11 15:14:09,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:09,760 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2020-10-11 15:14:09,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:14:09,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:14:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:09,809 INFO L225 Difference]: With dead ends: 17885 [2020-10-11 15:14:09,809 INFO L226 Difference]: Without dead ends: 16791 [2020-10-11 15:14:09,809 INFO L673 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-10-11 15:14:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2020-10-11 15:14:10,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16791. [2020-10-11 15:14:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16791 states. [2020-10-11 15:14:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16791 states to 16791 states and 86558 transitions. [2020-10-11 15:14:10,539 INFO L78 Accepts]: Start accepts. Automaton has 16791 states and 86558 transitions. Word has length 3 [2020-10-11 15:14:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:10,539 INFO L481 AbstractCegarLoop]: Abstraction has 16791 states and 86558 transitions. [2020-10-11 15:14:10,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:14:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 16791 states and 86558 transitions. [2020-10-11 15:14:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:14:10,539 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:10,539 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:10,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-10-11 15:14:10,540 INFO L429 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-10-11 15:14:10,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:10,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1124534846, now seen corresponding path program 1 times [2020-10-11 15:14:10,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:10,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406161922] [2020-10-11 15:14:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:14:10,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406161922] [2020-10-11 15:14:10,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:10,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:14:10,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680486772] [2020-10-11 15:14:10,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:14:10,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:10,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:14:10,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:14:10,559 INFO L87 Difference]: Start difference. First operand 16791 states and 86558 transitions. Second operand 5 states. [2020-10-11 15:14:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:10,782 INFO L93 Difference]: Finished difference Result 30985 states and 150574 transitions. [2020-10-11 15:14:10,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:14:10,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-11 15:14:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:10,874 INFO L225 Difference]: With dead ends: 30985 [2020-10-11 15:14:10,874 INFO L226 Difference]: Without dead ends: 30977 [2020-10-11 15:14:10,875 INFO L673 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-10-11 15:14:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30977 states. [2020-10-11 15:14:11,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30977 to 19868. [2020-10-11 15:14:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19868 states. [2020-10-11 15:14:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19868 states to 19868 states and 103363 transitions. [2020-10-11 15:14:11,855 INFO L78 Accepts]: Start accepts. Automaton has 19868 states and 103363 transitions. Word has length 9 [2020-10-11 15:14:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:11,855 INFO L481 AbstractCegarLoop]: Abstraction has 19868 states and 103363 transitions. [2020-10-11 15:14:11,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:14:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 19868 states and 103363 transitions. [2020-10-11 15:14:11,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:14:11,856 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:11,856 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:11,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-10-11 15:14:11,856 INFO L429 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-10-11 15:14:11,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:11,856 INFO L82 PathProgramCache]: Analyzing trace with hash -696216523, now seen corresponding path program 1 times [2020-10-11 15:14:11,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:11,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717760961] [2020-10-11 15:14:11,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:14:11,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717760961] [2020-10-11 15:14:11,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:11,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:14:11,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816487857] [2020-10-11 15:14:11,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:14:11,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:11,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:14:11,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:14:11,881 INFO L87 Difference]: Start difference. First operand 19868 states and 103363 transitions. Second operand 5 states. [2020-10-11 15:14:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:12,123 INFO L93 Difference]: Finished difference Result 36296 states and 178836 transitions. [2020-10-11 15:14:12,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:14:12,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:14:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:12,238 INFO L225 Difference]: With dead ends: 36296 [2020-10-11 15:14:12,239 INFO L226 Difference]: Without dead ends: 36280 [2020-10-11 15:14:12,239 INFO L673 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-10-11 15:14:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36280 states. [2020-10-11 15:14:15,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36280 to 23806. [2020-10-11 15:14:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23806 states. [2020-10-11 15:14:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 125455 transitions. [2020-10-11 15:14:15,251 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 125455 transitions. Word has length 13 [2020-10-11 15:14:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:15,251 INFO L481 AbstractCegarLoop]: Abstraction has 23806 states and 125455 transitions. [2020-10-11 15:14:15,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:14:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 125455 transitions. [2020-10-11 15:14:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:14:15,252 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:15,252 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:15,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-10-11 15:14:15,252 INFO L429 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-10-11 15:14:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:15,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2123666531, now seen corresponding path program 1 times [2020-10-11 15:14:15,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:15,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337346134] [2020-10-11 15:14:15,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:14:15,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337346134] [2020-10-11 15:14:15,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151114921] [2020-10-11 15:14:15,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:14:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:15,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:14:15,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:14:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:14:15,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:14:15,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:14:15,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703524423] [2020-10-11 15:14:15,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:15,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:15,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:15,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:15,382 INFO L87 Difference]: Start difference. First operand 23806 states and 125455 transitions. Second operand 9 states. [2020-10-11 15:14:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:15,871 INFO L93 Difference]: Finished difference Result 56720 states and 262685 transitions. [2020-10-11 15:14:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:14:15,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-11 15:14:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:16,035 INFO L225 Difference]: With dead ends: 56720 [2020-10-11 15:14:16,035 INFO L226 Difference]: Without dead ends: 56704 [2020-10-11 15:14:16,036 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:14:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56704 states. [2020-10-11 15:14:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56704 to 23629. [2020-10-11 15:14:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23629 states. [2020-10-11 15:14:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23629 states to 23629 states and 124418 transitions. [2020-10-11 15:14:17,458 INFO L78 Accepts]: Start accepts. Automaton has 23629 states and 124418 transitions. Word has length 15 [2020-10-11 15:14:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:17,458 INFO L481 AbstractCegarLoop]: Abstraction has 23629 states and 124418 transitions. [2020-10-11 15:14:17,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 23629 states and 124418 transitions. [2020-10-11 15:14:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:14:17,459 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:17,459 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:17,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-10-11 15:14:17,660 INFO L429 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-10-11 15:14:17,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:17,660 INFO L82 PathProgramCache]: Analyzing trace with hash 950817645, now seen corresponding path program 2 times [2020-10-11 15:14:17,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:17,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492274968] [2020-10-11 15:14:17,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:14:17,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492274968] [2020-10-11 15:14:17,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:17,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:14:17,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051161044] [2020-10-11 15:14:17,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:14:17,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:17,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:14:17,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:14:17,692 INFO L87 Difference]: Start difference. First operand 23629 states and 124418 transitions. Second operand 7 states. [2020-10-11 15:14:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:18,176 INFO L93 Difference]: Finished difference Result 58078 states and 269185 transitions. [2020-10-11 15:14:18,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:14:18,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 15:14:18,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:18,351 INFO L225 Difference]: With dead ends: 58078 [2020-10-11 15:14:18,351 INFO L226 Difference]: Without dead ends: 58061 [2020-10-11 15:14:18,351 INFO L673 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-10-11 15:14:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58061 states. [2020-10-11 15:14:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58061 to 23109. [2020-10-11 15:14:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23109 states. [2020-10-11 15:14:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 121651 transitions. [2020-10-11 15:14:21,938 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 121651 transitions. Word has length 15 [2020-10-11 15:14:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:21,939 INFO L481 AbstractCegarLoop]: Abstraction has 23109 states and 121651 transitions. [2020-10-11 15:14:21,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:14:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 121651 transitions. [2020-10-11 15:14:21,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 15:14:21,939 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:21,939 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:21,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-10-11 15:14:21,939 INFO L429 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-10-11 15:14:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:21,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2120658652, now seen corresponding path program 1 times [2020-10-11 15:14:21,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:21,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549102854] [2020-10-11 15:14:21,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:21,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549102854] [2020-10-11 15:14:21,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:21,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:14:21,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205852043] [2020-10-11 15:14:21,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:14:21,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:21,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:14:21,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:14:21,964 INFO L87 Difference]: Start difference. First operand 23109 states and 121651 transitions. Second operand 5 states. [2020-10-11 15:14:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:22,255 INFO L93 Difference]: Finished difference Result 41885 states and 209629 transitions. [2020-10-11 15:14:22,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:14:22,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-11 15:14:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:22,375 INFO L225 Difference]: With dead ends: 41885 [2020-10-11 15:14:22,375 INFO L226 Difference]: Without dead ends: 41856 [2020-10-11 15:14:22,375 INFO L673 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-10-11 15:14:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41856 states. [2020-10-11 15:14:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41856 to 28237. [2020-10-11 15:14:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28237 states. [2020-10-11 15:14:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28237 states to 28237 states and 150261 transitions. [2020-10-11 15:14:23,670 INFO L78 Accepts]: Start accepts. Automaton has 28237 states and 150261 transitions. Word has length 17 [2020-10-11 15:14:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:23,670 INFO L481 AbstractCegarLoop]: Abstraction has 28237 states and 150261 transitions. [2020-10-11 15:14:23,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:14:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 28237 states and 150261 transitions. [2020-10-11 15:14:23,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:14:23,671 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:23,671 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:23,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-10-11 15:14:23,671 INFO L429 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-10-11 15:14:23,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:23,671 INFO L82 PathProgramCache]: Analyzing trace with hash 269605662, now seen corresponding path program 1 times [2020-10-11 15:14:23,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:23,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887977977] [2020-10-11 15:14:23,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:14:23,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887977977] [2020-10-11 15:14:23,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119361301] [2020-10-11 15:14:23,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:14:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:23,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:14:23,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:14:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:14:23,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:14:23,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:14:23,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279594855] [2020-10-11 15:14:23,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:23,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:23,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:23,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:23,803 INFO L87 Difference]: Start difference. First operand 28237 states and 150261 transitions. Second operand 9 states. [2020-10-11 15:14:24,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:24,323 INFO L93 Difference]: Finished difference Result 66831 states and 314874 transitions. [2020-10-11 15:14:24,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:14:24,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-11 15:14:24,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:24,507 INFO L225 Difference]: With dead ends: 66831 [2020-10-11 15:14:24,507 INFO L226 Difference]: Without dead ends: 66807 [2020-10-11 15:14:24,508 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:14:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66807 states. [2020-10-11 15:14:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66807 to 28673. [2020-10-11 15:14:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28673 states. [2020-10-11 15:14:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28673 states to 28673 states and 152375 transitions. [2020-10-11 15:14:27,053 INFO L78 Accepts]: Start accepts. Automaton has 28673 states and 152375 transitions. Word has length 19 [2020-10-11 15:14:27,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:27,053 INFO L481 AbstractCegarLoop]: Abstraction has 28673 states and 152375 transitions. [2020-10-11 15:14:27,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 28673 states and 152375 transitions. [2020-10-11 15:14:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:14:27,054 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:27,054 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:27,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2020-10-11 15:14:27,270 INFO L429 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-10-11 15:14:27,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:27,270 INFO L82 PathProgramCache]: Analyzing trace with hash -2138468196, now seen corresponding path program 2 times [2020-10-11 15:14:27,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:27,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256462911] [2020-10-11 15:14:27,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:27,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256462911] [2020-10-11 15:14:27,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:27,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:14:27,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041967863] [2020-10-11 15:14:27,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:14:27,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:27,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:14:27,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:14:27,301 INFO L87 Difference]: Start difference. First operand 28673 states and 152375 transitions. Second operand 7 states. [2020-10-11 15:14:27,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:27,814 INFO L93 Difference]: Finished difference Result 68538 states and 323189 transitions. [2020-10-11 15:14:27,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:14:27,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:14:27,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:28,003 INFO L225 Difference]: With dead ends: 68538 [2020-10-11 15:14:28,003 INFO L226 Difference]: Without dead ends: 68505 [2020-10-11 15:14:28,003 INFO L673 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-10-11 15:14:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68505 states. [2020-10-11 15:14:29,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68505 to 28061. [2020-10-11 15:14:29,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28061 states. [2020-10-11 15:14:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28061 states to 28061 states and 149307 transitions. [2020-10-11 15:14:29,715 INFO L78 Accepts]: Start accepts. Automaton has 28061 states and 149307 transitions. Word has length 19 [2020-10-11 15:14:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:29,716 INFO L481 AbstractCegarLoop]: Abstraction has 28061 states and 149307 transitions. [2020-10-11 15:14:29,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:14:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 28061 states and 149307 transitions. [2020-10-11 15:14:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:14:29,716 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:29,717 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:29,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2020-10-11 15:14:29,717 INFO L429 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-10-11 15:14:29,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:29,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2138444729, now seen corresponding path program 1 times [2020-10-11 15:14:29,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:29,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985628949] [2020-10-11 15:14:29,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:29,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985628949] [2020-10-11 15:14:29,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:29,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:14:29,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334908164] [2020-10-11 15:14:29,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:14:29,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:29,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:14:29,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:14:29,744 INFO L87 Difference]: Start difference. First operand 28061 states and 149307 transitions. Second operand 7 states. [2020-10-11 15:14:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:30,267 INFO L93 Difference]: Finished difference Result 69070 states and 326154 transitions. [2020-10-11 15:14:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:14:30,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:14:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:30,461 INFO L225 Difference]: With dead ends: 69070 [2020-10-11 15:14:30,461 INFO L226 Difference]: Without dead ends: 69037 [2020-10-11 15:14:30,461 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:14:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69037 states. [2020-10-11 15:14:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69037 to 28938. [2020-10-11 15:14:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28938 states. [2020-10-11 15:14:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28938 states to 28938 states and 153909 transitions. [2020-10-11 15:14:34,675 INFO L78 Accepts]: Start accepts. Automaton has 28938 states and 153909 transitions. Word has length 19 [2020-10-11 15:14:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:34,676 INFO L481 AbstractCegarLoop]: Abstraction has 28938 states and 153909 transitions. [2020-10-11 15:14:34,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:14:34,676 INFO L276 IsEmpty]: Start isEmpty. Operand 28938 states and 153909 transitions. [2020-10-11 15:14:34,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:14:34,676 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:34,676 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:34,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-10-11 15:14:34,677 INFO L429 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-10-11 15:14:34,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:34,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2117255609, now seen corresponding path program 2 times [2020-10-11 15:14:34,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:34,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893154006] [2020-10-11 15:14:34,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:34,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893154006] [2020-10-11 15:14:34,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:34,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:14:34,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785312843] [2020-10-11 15:14:34,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:14:34,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:34,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:14:34,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:14:34,707 INFO L87 Difference]: Start difference. First operand 28938 states and 153909 transitions. Second operand 7 states. [2020-10-11 15:14:35,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:35,225 INFO L93 Difference]: Finished difference Result 70096 states and 331298 transitions. [2020-10-11 15:14:35,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:14:35,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:14:35,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:35,429 INFO L225 Difference]: With dead ends: 70096 [2020-10-11 15:14:35,429 INFO L226 Difference]: Without dead ends: 70063 [2020-10-11 15:14:35,429 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:14:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70063 states. [2020-10-11 15:14:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70063 to 29094. [2020-10-11 15:14:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29094 states. [2020-10-11 15:14:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 154883 transitions. [2020-10-11 15:14:37,144 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 154883 transitions. Word has length 19 [2020-10-11 15:14:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:37,144 INFO L481 AbstractCegarLoop]: Abstraction has 29094 states and 154883 transitions. [2020-10-11 15:14:37,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:14:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 154883 transitions. [2020-10-11 15:14:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:14:37,145 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:37,145 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:37,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-10-11 15:14:37,146 INFO L429 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-10-11 15:14:37,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:37,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1393024961, now seen corresponding path program 1 times [2020-10-11 15:14:37,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:37,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553106536] [2020-10-11 15:14:37,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:14:37,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553106536] [2020-10-11 15:14:37,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666610088] [2020-10-11 15:14:37,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:14:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:37,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:14:37,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:14:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:14:37,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:14:37,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:14:37,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752120498] [2020-10-11 15:14:37,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:14:37,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:37,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:14:37,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:14:37,302 INFO L87 Difference]: Start difference. First operand 29094 states and 154883 transitions. Second operand 11 states. [2020-10-11 15:14:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:38,349 INFO L93 Difference]: Finished difference Result 100731 states and 448596 transitions. [2020-10-11 15:14:38,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:38,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:14:38,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:38,623 INFO L225 Difference]: With dead ends: 100731 [2020-10-11 15:14:38,623 INFO L226 Difference]: Without dead ends: 100715 [2020-10-11 15:14:38,624 INFO L673 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-10-11 15:14:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100715 states. [2020-10-11 15:14:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100715 to 28723. [2020-10-11 15:14:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28723 states. [2020-10-11 15:14:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 152772 transitions. [2020-10-11 15:14:41,565 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 152772 transitions. Word has length 21 [2020-10-11 15:14:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:41,565 INFO L481 AbstractCegarLoop]: Abstraction has 28723 states and 152772 transitions. [2020-10-11 15:14:41,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:14:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 152772 transitions. [2020-10-11 15:14:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:14:41,566 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:41,566 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:41,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:14:41,767 INFO L429 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-10-11 15:14:41,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:41,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1414214081, now seen corresponding path program 2 times [2020-10-11 15:14:41,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:41,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394313412] [2020-10-11 15:14:41,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:14:41,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394313412] [2020-10-11 15:14:41,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990253993] [2020-10-11 15:14:41,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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-10-11 15:14:41,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:14:41,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:14:41,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:14:41,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:14:41,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:14:41,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:14:41,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:14:41,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638688242] [2020-10-11 15:14:41,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:14:41,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:41,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:14:41,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:14:41,920 INFO L87 Difference]: Start difference. First operand 28723 states and 152772 transitions. Second operand 11 states. [2020-10-11 15:14:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:42,964 INFO L93 Difference]: Finished difference Result 99884 states and 444368 transitions. [2020-10-11 15:14:42,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:42,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:14:42,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:43,236 INFO L225 Difference]: With dead ends: 99884 [2020-10-11 15:14:43,237 INFO L226 Difference]: Without dead ends: 99863 [2020-10-11 15:14:43,237 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:14:44,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99863 states. [2020-10-11 15:14:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99863 to 28343. [2020-10-11 15:14:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28343 states. [2020-10-11 15:14:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28343 states to 28343 states and 150639 transitions. [2020-10-11 15:14:45,374 INFO L78 Accepts]: Start accepts. Automaton has 28343 states and 150639 transitions. Word has length 21 [2020-10-11 15:14:45,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:45,374 INFO L481 AbstractCegarLoop]: Abstraction has 28343 states and 150639 transitions. [2020-10-11 15:14:45,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:14:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 28343 states and 150639 transitions. [2020-10-11 15:14:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:14:45,375 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:45,375 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:45,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2020-10-11 15:14:45,576 INFO L429 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-10-11 15:14:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:45,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2073547329, now seen corresponding path program 3 times [2020-10-11 15:14:45,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:45,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349977661] [2020-10-11 15:14:45,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:45,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349977661] [2020-10-11 15:14:45,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:45,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:45,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017636552] [2020-10-11 15:14:45,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:45,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:45,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:45,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:45,631 INFO L87 Difference]: Start difference. First operand 28343 states and 150639 transitions. Second operand 9 states. [2020-10-11 15:14:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:46,732 INFO L93 Difference]: Finished difference Result 100063 states and 445271 transitions. [2020-10-11 15:14:46,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:46,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:14:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:47,042 INFO L225 Difference]: With dead ends: 100063 [2020-10-11 15:14:47,042 INFO L226 Difference]: Without dead ends: 100047 [2020-10-11 15:14:47,042 INFO L673 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-10-11 15:14:48,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100047 states. [2020-10-11 15:14:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100047 to 27662. [2020-10-11 15:14:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27662 states. [2020-10-11 15:14:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27662 states to 27662 states and 147100 transitions. [2020-10-11 15:14:49,803 INFO L78 Accepts]: Start accepts. Automaton has 27662 states and 147100 transitions. Word has length 21 [2020-10-11 15:14:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:49,803 INFO L481 AbstractCegarLoop]: Abstraction has 27662 states and 147100 transitions. [2020-10-11 15:14:49,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand 27662 states and 147100 transitions. [2020-10-11 15:14:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:14:49,804 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:49,804 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:49,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2020-10-11 15:14:49,804 INFO L429 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-10-11 15:14:49,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:49,804 INFO L82 PathProgramCache]: Analyzing trace with hash -2051019009, now seen corresponding path program 4 times [2020-10-11 15:14:49,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:49,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331023047] [2020-10-11 15:14:49,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:49,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331023047] [2020-10-11 15:14:49,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:49,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:49,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742319517] [2020-10-11 15:14:49,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:49,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:49,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:49,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:49,854 INFO L87 Difference]: Start difference. First operand 27662 states and 147100 transitions. Second operand 9 states. [2020-10-11 15:14:50,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:50,875 INFO L93 Difference]: Finished difference Result 99531 states and 442783 transitions. [2020-10-11 15:14:50,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:50,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:14:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:51,147 INFO L225 Difference]: With dead ends: 99531 [2020-10-11 15:14:51,147 INFO L226 Difference]: Without dead ends: 99510 [2020-10-11 15:14:51,147 INFO L673 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-10-11 15:14:52,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99510 states. [2020-10-11 15:14:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99510 to 27286. [2020-10-11 15:14:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27286 states. [2020-10-11 15:14:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27286 states to 27286 states and 144979 transitions. [2020-10-11 15:14:53,283 INFO L78 Accepts]: Start accepts. Automaton has 27286 states and 144979 transitions. Word has length 21 [2020-10-11 15:14:53,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:53,283 INFO L481 AbstractCegarLoop]: Abstraction has 27286 states and 144979 transitions. [2020-10-11 15:14:53,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 27286 states and 144979 transitions. [2020-10-11 15:14:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:14:53,284 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:53,284 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:53,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2020-10-11 15:14:53,284 INFO L429 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-10-11 15:14:53,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:53,284 INFO L82 PathProgramCache]: Analyzing trace with hash 102150333, now seen corresponding path program 1 times [2020-10-11 15:14:53,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:53,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677198207] [2020-10-11 15:14:53,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:14:53,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677198207] [2020-10-11 15:14:53,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:53,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:14:53,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749824852] [2020-10-11 15:14:53,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:14:53,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:14:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:14:53,303 INFO L87 Difference]: Start difference. First operand 27286 states and 144979 transitions. Second operand 5 states. [2020-10-11 15:14:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:53,627 INFO L93 Difference]: Finished difference Result 49004 states and 248721 transitions. [2020-10-11 15:14:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:14:53,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-11 15:14:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:53,765 INFO L225 Difference]: With dead ends: 49004 [2020-10-11 15:14:53,766 INFO L226 Difference]: Without dead ends: 48958 [2020-10-11 15:14:53,766 INFO L673 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-10-11 15:14:54,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48958 states. [2020-10-11 15:14:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48958 to 33985. [2020-10-11 15:14:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33985 states. [2020-10-11 15:14:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33985 states to 33985 states and 181777 transitions. [2020-10-11 15:14:55,568 INFO L78 Accepts]: Start accepts. Automaton has 33985 states and 181777 transitions. Word has length 21 [2020-10-11 15:14:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:55,568 INFO L481 AbstractCegarLoop]: Abstraction has 33985 states and 181777 transitions. [2020-10-11 15:14:55,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:14:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 33985 states and 181777 transitions. [2020-10-11 15:14:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:14:55,569 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:55,570 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:55,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2020-10-11 15:14:55,570 INFO L429 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-10-11 15:14:55,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:55,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1130516927, now seen corresponding path program 5 times [2020-10-11 15:14:55,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:55,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506084312] [2020-10-11 15:14:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:55,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506084312] [2020-10-11 15:14:55,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:55,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:55,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479431884] [2020-10-11 15:14:55,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:55,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:55,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:55,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:55,618 INFO L87 Difference]: Start difference. First operand 33985 states and 181777 transitions. Second operand 9 states. [2020-10-11 15:14:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:56,742 INFO L93 Difference]: Finished difference Result 115592 states and 523747 transitions. [2020-10-11 15:14:56,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:56,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:14:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:57,063 INFO L225 Difference]: With dead ends: 115592 [2020-10-11 15:14:57,063 INFO L226 Difference]: Without dead ends: 115567 [2020-10-11 15:14:57,063 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:14:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115567 states. [2020-10-11 15:14:59,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115567 to 33074. [2020-10-11 15:14:59,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33074 states. [2020-10-11 15:14:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33074 states to 33074 states and 176935 transitions. [2020-10-11 15:14:59,556 INFO L78 Accepts]: Start accepts. Automaton has 33074 states and 176935 transitions. Word has length 21 [2020-10-11 15:14:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:59,556 INFO L481 AbstractCegarLoop]: Abstraction has 33074 states and 176935 transitions. [2020-10-11 15:14:59,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 33074 states and 176935 transitions. [2020-10-11 15:14:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:14:59,558 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:59,558 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:59,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-10-11 15:14:59,558 INFO L429 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-10-11 15:14:59,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:59,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1131856127, now seen corresponding path program 6 times [2020-10-11 15:14:59,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:59,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120630841] [2020-10-11 15:14:59,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:59,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120630841] [2020-10-11 15:14:59,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:59,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:59,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855453105] [2020-10-11 15:14:59,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:59,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:59,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:59,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:59,610 INFO L87 Difference]: Start difference. First operand 33074 states and 176935 transitions. Second operand 9 states. [2020-10-11 15:15:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:00,710 INFO L93 Difference]: Finished difference Result 114402 states and 517732 transitions. [2020-10-11 15:15:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:00,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:15:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:01,068 INFO L225 Difference]: With dead ends: 114402 [2020-10-11 15:15:01,069 INFO L226 Difference]: Without dead ends: 114371 [2020-10-11 15:15:01,069 INFO L673 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-10-11 15:15:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114371 states. [2020-10-11 15:15:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114371 to 31960. [2020-10-11 15:15:03,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31960 states. [2020-10-11 15:15:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31960 states to 31960 states and 171209 transitions. [2020-10-11 15:15:04,120 INFO L78 Accepts]: Start accepts. Automaton has 31960 states and 171209 transitions. Word has length 21 [2020-10-11 15:15:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:04,120 INFO L481 AbstractCegarLoop]: Abstraction has 31960 states and 171209 transitions. [2020-10-11 15:15:04,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:15:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 31960 states and 171209 transitions. [2020-10-11 15:15:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:15:04,122 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:04,122 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:04,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-10-11 15:15:04,122 INFO L429 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-10-11 15:15:04,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:04,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1106577557, now seen corresponding path program 1 times [2020-10-11 15:15:04,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:04,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235142401] [2020-10-11 15:15:04,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:04,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235142401] [2020-10-11 15:15:04,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114175084] [2020-10-11 15:15:04,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:15:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:04,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:15:04,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:04,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:04,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:15:04,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740711873] [2020-10-11 15:15:04,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:15:04,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:04,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:15:04,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:15:04,272 INFO L87 Difference]: Start difference. First operand 31960 states and 171209 transitions. Second operand 9 states. [2020-10-11 15:15:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:04,881 INFO L93 Difference]: Finished difference Result 75380 states and 361389 transitions. [2020-10-11 15:15:04,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:15:04,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-11 15:15:04,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:05,095 INFO L225 Difference]: With dead ends: 75380 [2020-10-11 15:15:05,095 INFO L226 Difference]: Without dead ends: 75344 [2020-10-11 15:15:05,095 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:15:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75344 states. [2020-10-11 15:15:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75344 to 32974. [2020-10-11 15:15:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32974 states. [2020-10-11 15:15:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32974 states to 32974 states and 176363 transitions. [2020-10-11 15:15:06,982 INFO L78 Accepts]: Start accepts. Automaton has 32974 states and 176363 transitions. Word has length 23 [2020-10-11 15:15:06,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:06,983 INFO L481 AbstractCegarLoop]: Abstraction has 32974 states and 176363 transitions. [2020-10-11 15:15:06,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:15:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 32974 states and 176363 transitions. [2020-10-11 15:15:06,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:15:06,985 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:06,985 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:07,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:07,186 INFO L429 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-10-11 15:15:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1026706248, now seen corresponding path program 1 times [2020-10-11 15:15:07,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:07,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322959767] [2020-10-11 15:15:07,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:07,220 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:07,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322959767] [2020-10-11 15:15:07,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961978636] [2020-10-11 15:15:07,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:15:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:07,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:15:07,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:07,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:07,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:15:07,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700870981] [2020-10-11 15:15:07,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:15:07,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:07,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:15:07,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:15:07,323 INFO L87 Difference]: Start difference. First operand 32974 states and 176363 transitions. Second operand 9 states. [2020-10-11 15:15:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:07,937 INFO L93 Difference]: Finished difference Result 79463 states and 381713 transitions. [2020-10-11 15:15:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:15:07,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-11 15:15:07,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:08,165 INFO L225 Difference]: With dead ends: 79463 [2020-10-11 15:15:08,165 INFO L226 Difference]: Without dead ends: 79421 [2020-10-11 15:15:08,166 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:15:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79421 states. [2020-10-11 15:15:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79421 to 33977. [2020-10-11 15:15:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33977 states. [2020-10-11 15:15:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33977 states to 33977 states and 181698 transitions. [2020-10-11 15:15:10,612 INFO L78 Accepts]: Start accepts. Automaton has 33977 states and 181698 transitions. Word has length 23 [2020-10-11 15:15:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:10,612 INFO L481 AbstractCegarLoop]: Abstraction has 33977 states and 181698 transitions. [2020-10-11 15:15:10,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:15:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 33977 states and 181698 transitions. [2020-10-11 15:15:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:15:10,614 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:10,614 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:10,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:10,815 INFO L429 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-10-11 15:15:10,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:10,816 INFO L82 PathProgramCache]: Analyzing trace with hash -617779723, now seen corresponding path program 2 times [2020-10-11 15:15:10,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:10,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811319534] [2020-10-11 15:15:10,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:15:10,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811319534] [2020-10-11 15:15:10,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:15:10,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:15:10,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634178361] [2020-10-11 15:15:10,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:15:10,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:10,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:15:10,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:15:10,849 INFO L87 Difference]: Start difference. First operand 33977 states and 181698 transitions. Second operand 7 states. [2020-10-11 15:15:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:11,455 INFO L93 Difference]: Finished difference Result 80867 states and 388763 transitions. [2020-10-11 15:15:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:15:11,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-11 15:15:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:11,685 INFO L225 Difference]: With dead ends: 80867 [2020-10-11 15:15:11,685 INFO L226 Difference]: Without dead ends: 80812 [2020-10-11 15:15:11,686 INFO L673 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-10-11 15:15:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80812 states. [2020-10-11 15:15:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80812 to 34223. [2020-10-11 15:15:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34223 states. [2020-10-11 15:15:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34223 states to 34223 states and 183033 transitions. [2020-10-11 15:15:13,667 INFO L78 Accepts]: Start accepts. Automaton has 34223 states and 183033 transitions. Word has length 23 [2020-10-11 15:15:13,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:13,667 INFO L481 AbstractCegarLoop]: Abstraction has 34223 states and 183033 transitions. [2020-10-11 15:15:13,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:15:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 34223 states and 183033 transitions. [2020-10-11 15:15:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:15:13,669 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:13,669 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:13,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2020-10-11 15:15:13,669 INFO L429 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-10-11 15:15:13,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:13,669 INFO L82 PathProgramCache]: Analyzing trace with hash -617778328, now seen corresponding path program 2 times [2020-10-11 15:15:13,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:13,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740890867] [2020-10-11 15:15:13,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:15:13,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740890867] [2020-10-11 15:15:13,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:15:13,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:15:13,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617267920] [2020-10-11 15:15:13,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:15:13,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:13,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:15:13,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:15:13,703 INFO L87 Difference]: Start difference. First operand 34223 states and 183033 transitions. Second operand 7 states. [2020-10-11 15:15:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:14,288 INFO L93 Difference]: Finished difference Result 80887 states and 388540 transitions. [2020-10-11 15:15:14,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:15:14,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-11 15:15:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:14,521 INFO L225 Difference]: With dead ends: 80887 [2020-10-11 15:15:14,521 INFO L226 Difference]: Without dead ends: 80832 [2020-10-11 15:15:14,521 INFO L673 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-10-11 15:15:15,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80832 states. [2020-10-11 15:15:16,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80832 to 34508. [2020-10-11 15:15:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34508 states. [2020-10-11 15:15:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34508 states to 34508 states and 184670 transitions. [2020-10-11 15:15:17,459 INFO L78 Accepts]: Start accepts. Automaton has 34508 states and 184670 transitions. Word has length 23 [2020-10-11 15:15:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:17,459 INFO L481 AbstractCegarLoop]: Abstraction has 34508 states and 184670 transitions. [2020-10-11 15:15:17,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:15:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 34508 states and 184670 transitions. [2020-10-11 15:15:17,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:15:17,461 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:17,461 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:17,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2020-10-11 15:15:17,461 INFO L429 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-10-11 15:15:17,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash -617756256, now seen corresponding path program 1 times [2020-10-11 15:15:17,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:17,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4252037] [2020-10-11 15:15:17,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:15:17,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4252037] [2020-10-11 15:15:17,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:15:17,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:15:17,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796139472] [2020-10-11 15:15:17,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:15:17,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:17,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:15:17,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:15:17,508 INFO L87 Difference]: Start difference. First operand 34508 states and 184670 transitions. Second operand 7 states. [2020-10-11 15:15:18,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:18,136 INFO L93 Difference]: Finished difference Result 83313 states and 401031 transitions. [2020-10-11 15:15:18,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:15:18,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-11 15:15:18,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:18,378 INFO L225 Difference]: With dead ends: 83313 [2020-10-11 15:15:18,378 INFO L226 Difference]: Without dead ends: 83258 [2020-10-11 15:15:18,378 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:15:19,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83258 states. [2020-10-11 15:15:20,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83258 to 36258. [2020-10-11 15:15:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36258 states. [2020-10-11 15:15:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36258 states to 36258 states and 193887 transitions. [2020-10-11 15:15:20,460 INFO L78 Accepts]: Start accepts. Automaton has 36258 states and 193887 transitions. Word has length 23 [2020-10-11 15:15:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:20,460 INFO L481 AbstractCegarLoop]: Abstraction has 36258 states and 193887 transitions. [2020-10-11 15:15:20,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:15:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 36258 states and 193887 transitions. [2020-10-11 15:15:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:15:20,462 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:20,462 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:20,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2020-10-11 15:15:20,462 INFO L429 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-10-11 15:15:20,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:20,462 INFO L82 PathProgramCache]: Analyzing trace with hash -581716896, now seen corresponding path program 2 times [2020-10-11 15:15:20,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:20,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497885673] [2020-10-11 15:15:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:15:20,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497885673] [2020-10-11 15:15:20,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:15:20,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:15:20,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18902046] [2020-10-11 15:15:20,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:15:20,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:20,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:15:20,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:15:20,493 INFO L87 Difference]: Start difference. First operand 36258 states and 193887 transitions. Second operand 7 states. [2020-10-11 15:15:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:21,133 INFO L93 Difference]: Finished difference Result 84364 states and 406246 transitions. [2020-10-11 15:15:21,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:15:21,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-11 15:15:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:21,381 INFO L225 Difference]: With dead ends: 84364 [2020-10-11 15:15:21,381 INFO L226 Difference]: Without dead ends: 84309 [2020-10-11 15:15:21,381 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:15:22,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84309 states. [2020-10-11 15:15:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84309 to 37062. [2020-10-11 15:15:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37062 states. [2020-10-11 15:15:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37062 states to 37062 states and 198528 transitions. [2020-10-11 15:15:23,465 INFO L78 Accepts]: Start accepts. Automaton has 37062 states and 198528 transitions. Word has length 23 [2020-10-11 15:15:23,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:23,465 INFO L481 AbstractCegarLoop]: Abstraction has 37062 states and 198528 transitions. [2020-10-11 15:15:23,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:15:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 37062 states and 198528 transitions. [2020-10-11 15:15:23,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:23,468 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:23,468 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:23,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2020-10-11 15:15:23,469 INFO L429 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-10-11 15:15:23,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:23,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1745706838, now seen corresponding path program 1 times [2020-10-11 15:15:23,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:23,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226324507] [2020-10-11 15:15:23,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:23,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226324507] [2020-10-11 15:15:23,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113581273] [2020-10-11 15:15:23,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:15:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:23,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:23,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:23,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:23,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:23,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829689997] [2020-10-11 15:15:23,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:23,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:23,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:23,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:23,624 INFO L87 Difference]: Start difference. First operand 37062 states and 198528 transitions. Second operand 11 states. [2020-10-11 15:15:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:24,816 INFO L93 Difference]: Finished difference Result 122892 states and 561130 transitions. [2020-10-11 15:15:24,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:24,816 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:25,155 INFO L225 Difference]: With dead ends: 122892 [2020-10-11 15:15:25,156 INFO L226 Difference]: Without dead ends: 122862 [2020-10-11 15:15:25,156 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122862 states. [2020-10-11 15:15:28,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122862 to 36735. [2020-10-11 15:15:28,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36735 states. [2020-10-11 15:15:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36735 states to 36735 states and 196486 transitions. [2020-10-11 15:15:28,351 INFO L78 Accepts]: Start accepts. Automaton has 36735 states and 196486 transitions. Word has length 25 [2020-10-11 15:15:28,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:28,351 INFO L481 AbstractCegarLoop]: Abstraction has 36735 states and 196486 transitions. [2020-10-11 15:15:28,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:15:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 36735 states and 196486 transitions. [2020-10-11 15:15:28,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:28,354 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:28,354 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:28,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2020-10-11 15:15:28,555 INFO L429 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-10-11 15:15:28,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:28,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1730856598, now seen corresponding path program 2 times [2020-10-11 15:15:28,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:28,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051988640] [2020-10-11 15:15:28,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:28,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051988640] [2020-10-11 15:15:28,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455527552] [2020-10-11 15:15:28,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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-10-11 15:15:28,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:15:28,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:15:28,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:28,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:28,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:28,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:28,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177951685] [2020-10-11 15:15:28,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:28,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:28,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:28,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:28,708 INFO L87 Difference]: Start difference. First operand 36735 states and 196486 transitions. Second operand 11 states. [2020-10-11 15:15:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:29,934 INFO L93 Difference]: Finished difference Result 121506 states and 554103 transitions. [2020-10-11 15:15:29,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:29,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:30,269 INFO L225 Difference]: With dead ends: 121506 [2020-10-11 15:15:30,269 INFO L226 Difference]: Without dead ends: 121473 [2020-10-11 15:15:30,269 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121473 states. [2020-10-11 15:15:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121473 to 36666. [2020-10-11 15:15:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36666 states. [2020-10-11 15:15:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36666 states to 36666 states and 195964 transitions. [2020-10-11 15:15:32,934 INFO L78 Accepts]: Start accepts. Automaton has 36666 states and 195964 transitions. Word has length 25 [2020-10-11 15:15:32,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:32,935 INFO L481 AbstractCegarLoop]: Abstraction has 36666 states and 195964 transitions. [2020-10-11 15:15:32,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:15:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 36666 states and 195964 transitions. [2020-10-11 15:15:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:32,940 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:32,940 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:33,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:33,141 INFO L429 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-10-11 15:15:33,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:33,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1730878670, now seen corresponding path program 1 times [2020-10-11 15:15:33,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:33,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57272758] [2020-10-11 15:15:33,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:33,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57272758] [2020-10-11 15:15:33,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338058271] [2020-10-11 15:15:33,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-11 15:15:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:33,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:33,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:33,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:33,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:33,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915880688] [2020-10-11 15:15:33,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:33,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:33,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:33,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:33,300 INFO L87 Difference]: Start difference. First operand 36666 states and 195964 transitions. Second operand 11 states. [2020-10-11 15:15:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:35,072 INFO L93 Difference]: Finished difference Result 120500 states and 549397 transitions. [2020-10-11 15:15:35,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:35,072 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:35,435 INFO L225 Difference]: With dead ends: 120500 [2020-10-11 15:15:35,435 INFO L226 Difference]: Without dead ends: 120470 [2020-10-11 15:15:35,435 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:36,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120470 states. [2020-10-11 15:15:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120470 to 36343. [2020-10-11 15:15:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36343 states. [2020-10-11 15:15:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36343 states to 36343 states and 194056 transitions. [2020-10-11 15:15:38,021 INFO L78 Accepts]: Start accepts. Automaton has 36343 states and 194056 transitions. Word has length 25 [2020-10-11 15:15:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:38,021 INFO L481 AbstractCegarLoop]: Abstraction has 36343 states and 194056 transitions. [2020-10-11 15:15:38,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:15:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 36343 states and 194056 transitions. [2020-10-11 15:15:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:38,023 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:38,024 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:38,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2020-10-11 15:15:38,224 INFO L429 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-10-11 15:15:38,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1766918030, now seen corresponding path program 2 times [2020-10-11 15:15:38,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:38,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573478343] [2020-10-11 15:15:38,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:38,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573478343] [2020-10-11 15:15:38,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227731864] [2020-10-11 15:15:38,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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-10-11 15:15:38,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:15:38,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:15:38,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:38,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:38,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:38,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:38,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777358138] [2020-10-11 15:15:38,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:38,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:38,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:38,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:38,381 INFO L87 Difference]: Start difference. First operand 36343 states and 194056 transitions. Second operand 11 states. [2020-10-11 15:15:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:39,585 INFO L93 Difference]: Finished difference Result 119731 states and 545560 transitions. [2020-10-11 15:15:39,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:39,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:39,921 INFO L225 Difference]: With dead ends: 119731 [2020-10-11 15:15:39,921 INFO L226 Difference]: Without dead ends: 119698 [2020-10-11 15:15:39,922 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119698 states. [2020-10-11 15:15:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119698 to 36040. [2020-10-11 15:15:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36040 states. [2020-10-11 15:15:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36040 states to 36040 states and 192287 transitions. [2020-10-11 15:15:42,515 INFO L78 Accepts]: Start accepts. Automaton has 36040 states and 192287 transitions. Word has length 25 [2020-10-11 15:15:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:42,516 INFO L481 AbstractCegarLoop]: Abstraction has 36040 states and 192287 transitions. [2020-10-11 15:15:42,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:15:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 36040 states and 192287 transitions. [2020-10-11 15:15:42,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:42,518 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:42,518 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:42,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:42,719 INFO L429 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-10-11 15:15:42,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:42,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1849107924, now seen corresponding path program 3 times [2020-10-11 15:15:42,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:42,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941950233] [2020-10-11 15:15:42,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:42,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941950233] [2020-10-11 15:15:42,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328891656] [2020-10-11 15:15:42,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/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-10-11 15:15:42,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:15:42,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:15:42,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:42,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:42,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:42,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:42,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578050281] [2020-10-11 15:15:42,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:42,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:42,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:42,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:42,866 INFO L87 Difference]: Start difference. First operand 36040 states and 192287 transitions. Second operand 11 states. [2020-10-11 15:15:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:44,508 INFO L93 Difference]: Finished difference Result 119762 states and 545615 transitions. [2020-10-11 15:15:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:44,508 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:44,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:44,840 INFO L225 Difference]: With dead ends: 119762 [2020-10-11 15:15:44,840 INFO L226 Difference]: Without dead ends: 119732 [2020-10-11 15:15:44,840 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:46,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119732 states. [2020-10-11 15:15:47,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119732 to 35475. [2020-10-11 15:15:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35475 states. [2020-10-11 15:15:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35475 states to 35475 states and 189246 transitions. [2020-10-11 15:15:47,406 INFO L78 Accepts]: Start accepts. Automaton has 35475 states and 189246 transitions. Word has length 25 [2020-10-11 15:15:47,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:47,406 INFO L481 AbstractCegarLoop]: Abstraction has 35475 states and 189246 transitions. [2020-10-11 15:15:47,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:15:47,406 INFO L276 IsEmpty]: Start isEmpty. Operand 35475 states and 189246 transitions. [2020-10-11 15:15:47,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:47,408 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:47,409 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:47,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2020-10-11 15:15:47,619 INFO L429 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-10-11 15:15:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:47,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1177775680, now seen corresponding path program 4 times [2020-10-11 15:15:47,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:47,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757880866] [2020-10-11 15:15:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:47,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757880866] [2020-10-11 15:15:47,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439707806] [2020-10-11 15:15:47,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/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-10-11 15:15:47,746 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:15:47,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:15:47,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:47,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:47,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:47,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:47,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700634395] [2020-10-11 15:15:47,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:47,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:47,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:47,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:47,765 INFO L87 Difference]: Start difference. First operand 35475 states and 189246 transitions. Second operand 11 states. [2020-10-11 15:15:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:48,983 INFO L93 Difference]: Finished difference Result 120788 states and 550630 transitions. [2020-10-11 15:15:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:48,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:49,317 INFO L225 Difference]: With dead ends: 120788 [2020-10-11 15:15:49,317 INFO L226 Difference]: Without dead ends: 120755 [2020-10-11 15:15:49,317 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:50,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120755 states. [2020-10-11 15:15:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120755 to 35406. [2020-10-11 15:15:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35406 states. [2020-10-11 15:15:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35406 states to 35406 states and 188724 transitions. [2020-10-11 15:15:51,933 INFO L78 Accepts]: Start accepts. Automaton has 35406 states and 188724 transitions. Word has length 25 [2020-10-11 15:15:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:51,933 INFO L481 AbstractCegarLoop]: Abstraction has 35406 states and 188724 transitions. [2020-10-11 15:15:51,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:15:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 35406 states and 188724 transitions. [2020-10-11 15:15:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:51,936 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:51,936 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:52,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2020-10-11 15:15:52,137 INFO L429 AbstractCegarLoop]: === Iteration 30 === [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-10-11 15:15:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:52,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1177752213, now seen corresponding path program 1 times [2020-10-11 15:15:52,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:52,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256671112] [2020-10-11 15:15:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:52,183 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:52,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256671112] [2020-10-11 15:15:52,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457663864] [2020-10-11 15:15:52,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:52,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:52,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:52,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:52,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:52,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281803142] [2020-10-11 15:15:52,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:52,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:52,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:52,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:52,286 INFO L87 Difference]: Start difference. First operand 35406 states and 188724 transitions. Second operand 11 states. [2020-10-11 15:15:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:53,930 INFO L93 Difference]: Finished difference Result 120291 states and 549128 transitions. [2020-10-11 15:15:53,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:53,930 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:53,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:54,268 INFO L225 Difference]: With dead ends: 120291 [2020-10-11 15:15:54,269 INFO L226 Difference]: Without dead ends: 120261 [2020-10-11 15:15:54,269 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120261 states. [2020-10-11 15:15:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120261 to 35196. [2020-10-11 15:15:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35196 states. [2020-10-11 15:15:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35196 states to 35196 states and 187476 transitions. [2020-10-11 15:15:56,848 INFO L78 Accepts]: Start accepts. Automaton has 35196 states and 187476 transitions. Word has length 25 [2020-10-11 15:15:56,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:56,849 INFO L481 AbstractCegarLoop]: Abstraction has 35196 states and 187476 transitions. [2020-10-11 15:15:56,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:15:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 35196 states and 187476 transitions. [2020-10-11 15:15:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:56,851 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:56,851 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:57,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:57,052 INFO L429 AbstractCegarLoop]: === Iteration 31 === [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-10-11 15:15:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:57,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1141712853, now seen corresponding path program 2 times [2020-10-11 15:15:57,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:57,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327994489] [2020-10-11 15:15:57,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:57,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327994489] [2020-10-11 15:15:57,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432870710] [2020-10-11 15:15:57,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:57,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:15:57,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:15:57,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:57,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:57,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:57,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:57,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830185912] [2020-10-11 15:15:57,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:57,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:57,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:57,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:57,202 INFO L87 Difference]: Start difference. First operand 35196 states and 187476 transitions. Second operand 11 states. [2020-10-11 15:15:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:58,344 INFO L93 Difference]: Finished difference Result 119264 states and 544110 transitions. [2020-10-11 15:15:58,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:58,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:58,695 INFO L225 Difference]: With dead ends: 119264 [2020-10-11 15:15:58,695 INFO L226 Difference]: Without dead ends: 119224 [2020-10-11 15:15:58,696 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:59,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119224 states. [2020-10-11 15:16:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119224 to 34815. [2020-10-11 15:16:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34815 states. [2020-10-11 15:16:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34815 states to 34815 states and 185342 transitions. [2020-10-11 15:16:01,222 INFO L78 Accepts]: Start accepts. Automaton has 34815 states and 185342 transitions. Word has length 25 [2020-10-11 15:16:01,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:01,223 INFO L481 AbstractCegarLoop]: Abstraction has 34815 states and 185342 transitions. [2020-10-11 15:16:01,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:16:01,223 INFO L276 IsEmpty]: Start isEmpty. Operand 34815 states and 185342 transitions. [2020-10-11 15:16:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:01,225 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:01,225 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:01,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2020-10-11 15:16:01,433 INFO L429 AbstractCegarLoop]: === Iteration 32 === [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-10-11 15:16:01,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:01,434 INFO L82 PathProgramCache]: Analyzing trace with hash -980827488, now seen corresponding path program 5 times [2020-10-11 15:16:01,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:01,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358287515] [2020-10-11 15:16:01,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:01,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358287515] [2020-10-11 15:16:01,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:01,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:01,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702135700] [2020-10-11 15:16:01,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:01,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:01,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:01,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:01,484 INFO L87 Difference]: Start difference. First operand 34815 states and 185342 transitions. Second operand 9 states. [2020-10-11 15:16:03,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:03,031 INFO L93 Difference]: Finished difference Result 119116 states and 542590 transitions. [2020-10-11 15:16:03,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:03,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:03,367 INFO L225 Difference]: With dead ends: 119116 [2020-10-11 15:16:03,367 INFO L226 Difference]: Without dead ends: 119086 [2020-10-11 15:16:03,367 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119086 states. [2020-10-11 15:16:05,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119086 to 34044. [2020-10-11 15:16:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34044 states. [2020-10-11 15:16:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34044 states to 34044 states and 181257 transitions. [2020-10-11 15:16:05,953 INFO L78 Accepts]: Start accepts. Automaton has 34044 states and 181257 transitions. Word has length 25 [2020-10-11 15:16:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:05,953 INFO L481 AbstractCegarLoop]: Abstraction has 34044 states and 181257 transitions. [2020-10-11 15:16:05,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 34044 states and 181257 transitions. [2020-10-11 15:16:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:05,956 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:05,956 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:05,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2020-10-11 15:16:05,956 INFO L429 AbstractCegarLoop]: === Iteration 33 === [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-10-11 15:16:05,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:05,956 INFO L82 PathProgramCache]: Analyzing trace with hash -980805416, now seen corresponding path program 3 times [2020-10-11 15:16:05,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:05,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746668579] [2020-10-11 15:16:05,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:06,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746668579] [2020-10-11 15:16:06,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:06,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:06,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960755332] [2020-10-11 15:16:06,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:06,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:06,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:06,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:06,005 INFO L87 Difference]: Start difference. First operand 34044 states and 181257 transitions. Second operand 9 states. [2020-10-11 15:16:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:07,149 INFO L93 Difference]: Finished difference Result 118392 states and 539774 transitions. [2020-10-11 15:16:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:07,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:07,511 INFO L225 Difference]: With dead ends: 118392 [2020-10-11 15:16:07,511 INFO L226 Difference]: Without dead ends: 118362 [2020-10-11 15:16:07,512 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:08,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118362 states. [2020-10-11 15:16:09,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118362 to 33530. [2020-10-11 15:16:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33530 states. [2020-10-11 15:16:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33530 states to 33530 states and 178563 transitions. [2020-10-11 15:16:10,045 INFO L78 Accepts]: Start accepts. Automaton has 33530 states and 178563 transitions. Word has length 25 [2020-10-11 15:16:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:10,045 INFO L481 AbstractCegarLoop]: Abstraction has 33530 states and 178563 transitions. [2020-10-11 15:16:10,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 33530 states and 178563 transitions. [2020-10-11 15:16:10,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:10,048 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:10,048 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:10,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2020-10-11 15:16:10,048 INFO L429 AbstractCegarLoop]: === Iteration 34 === [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-10-11 15:16:10,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:10,049 INFO L82 PathProgramCache]: Analyzing trace with hash -979488288, now seen corresponding path program 6 times [2020-10-11 15:16:10,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:10,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321875470] [2020-10-11 15:16:10,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:10,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321875470] [2020-10-11 15:16:10,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:10,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:10,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544753627] [2020-10-11 15:16:10,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:10,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:10,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:10,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:10,103 INFO L87 Difference]: Start difference. First operand 33530 states and 178563 transitions. Second operand 9 states. [2020-10-11 15:16:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:11,203 INFO L93 Difference]: Finished difference Result 116966 states and 531912 transitions. [2020-10-11 15:16:11,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:11,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:12,130 INFO L225 Difference]: With dead ends: 116966 [2020-10-11 15:16:12,131 INFO L226 Difference]: Without dead ends: 116926 [2020-10-11 15:16:12,131 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116926 states. [2020-10-11 15:16:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116926 to 32557. [2020-10-11 15:16:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32557 states. [2020-10-11 15:16:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32557 states to 32557 states and 173592 transitions. [2020-10-11 15:16:14,594 INFO L78 Accepts]: Start accepts. Automaton has 32557 states and 173592 transitions. Word has length 25 [2020-10-11 15:16:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:14,594 INFO L481 AbstractCegarLoop]: Abstraction has 32557 states and 173592 transitions. [2020-10-11 15:16:14,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 32557 states and 173592 transitions. [2020-10-11 15:16:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:14,597 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:14,597 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:14,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2020-10-11 15:16:14,597 INFO L429 AbstractCegarLoop]: === Iteration 35 === [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-10-11 15:16:14,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:14,597 INFO L82 PathProgramCache]: Analyzing trace with hash -979464821, now seen corresponding path program 3 times [2020-10-11 15:16:14,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:14,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680055405] [2020-10-11 15:16:14,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:14,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680055405] [2020-10-11 15:16:14,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:14,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:14,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209247728] [2020-10-11 15:16:14,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:14,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:14,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:14,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:14,647 INFO L87 Difference]: Start difference. First operand 32557 states and 173592 transitions. Second operand 9 states. [2020-10-11 15:16:15,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:15,734 INFO L93 Difference]: Finished difference Result 116421 states and 530054 transitions. [2020-10-11 15:16:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:15,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:15,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:16,087 INFO L225 Difference]: With dead ends: 116421 [2020-10-11 15:16:16,087 INFO L226 Difference]: Without dead ends: 116391 [2020-10-11 15:16:16,088 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116391 states. [2020-10-11 15:16:18,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116391 to 32226. [2020-10-11 15:16:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32226 states. [2020-10-11 15:16:18,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32226 states to 32226 states and 171898 transitions. [2020-10-11 15:16:18,512 INFO L78 Accepts]: Start accepts. Automaton has 32226 states and 171898 transitions. Word has length 25 [2020-10-11 15:16:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:18,512 INFO L481 AbstractCegarLoop]: Abstraction has 32226 states and 171898 transitions. [2020-10-11 15:16:18,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 32226 states and 171898 transitions. [2020-10-11 15:16:18,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:18,514 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:18,515 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:18,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2020-10-11 15:16:18,515 INFO L429 AbstractCegarLoop]: === Iteration 36 === [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-10-11 15:16:18,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:18,515 INFO L82 PathProgramCache]: Analyzing trace with hash -958277096, now seen corresponding path program 4 times [2020-10-11 15:16:18,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:18,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107384799] [2020-10-11 15:16:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:18,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107384799] [2020-10-11 15:16:18,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:18,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:18,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008324841] [2020-10-11 15:16:18,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:18,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:18,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:18,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:18,570 INFO L87 Difference]: Start difference. First operand 32226 states and 171898 transitions. Second operand 9 states. [2020-10-11 15:16:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:19,729 INFO L93 Difference]: Finished difference Result 116502 states and 530595 transitions. [2020-10-11 15:16:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:19,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:20,082 INFO L225 Difference]: With dead ends: 116502 [2020-10-11 15:16:20,082 INFO L226 Difference]: Without dead ends: 116462 [2020-10-11 15:16:20,082 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116462 states. [2020-10-11 15:16:22,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116462 to 32188. [2020-10-11 15:16:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32188 states. [2020-10-11 15:16:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32188 states to 32188 states and 171558 transitions. [2020-10-11 15:16:23,086 INFO L78 Accepts]: Start accepts. Automaton has 32188 states and 171558 transitions. Word has length 25 [2020-10-11 15:16:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:23,087 INFO L481 AbstractCegarLoop]: Abstraction has 32188 states and 171558 transitions. [2020-10-11 15:16:23,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 32188 states and 171558 transitions. [2020-10-11 15:16:23,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:23,089 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:23,089 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:23,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2020-10-11 15:16:23,089 INFO L429 AbstractCegarLoop]: === Iteration 37 === [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-10-11 15:16:23,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:23,090 INFO L82 PathProgramCache]: Analyzing trace with hash -958275701, now seen corresponding path program 4 times [2020-10-11 15:16:23,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:23,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132434860] [2020-10-11 15:16:23,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:23,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132434860] [2020-10-11 15:16:23,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:23,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:23,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024544783] [2020-10-11 15:16:23,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:23,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:23,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:23,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:23,138 INFO L87 Difference]: Start difference. First operand 32188 states and 171558 transitions. Second operand 9 states. [2020-10-11 15:16:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:24,333 INFO L93 Difference]: Finished difference Result 115555 states and 526107 transitions. [2020-10-11 15:16:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:24,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:24,691 INFO L225 Difference]: With dead ends: 115555 [2020-10-11 15:16:24,691 INFO L226 Difference]: Without dead ends: 115515 [2020-10-11 15:16:24,692 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:25,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115515 states. [2020-10-11 15:16:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115515 to 31998. [2020-10-11 15:16:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31998 states. [2020-10-11 15:16:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31998 states to 31998 states and 170450 transitions. [2020-10-11 15:16:27,120 INFO L78 Accepts]: Start accepts. Automaton has 31998 states and 170450 transitions. Word has length 25 [2020-10-11 15:16:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:27,120 INFO L481 AbstractCegarLoop]: Abstraction has 31998 states and 170450 transitions. [2020-10-11 15:16:27,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 31998 states and 170450 transitions. [2020-10-11 15:16:27,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:27,123 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:27,123 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:27,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2020-10-11 15:16:27,123 INFO L429 AbstractCegarLoop]: === Iteration 38 === [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-10-11 15:16:27,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:27,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1698987747, now seen corresponding path program 1 times [2020-10-11 15:16:27,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:27,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568678523] [2020-10-11 15:16:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:16:27,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568678523] [2020-10-11 15:16:27,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:27,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:16:27,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999968283] [2020-10-11 15:16:27,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:16:27,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:27,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:16:27,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:16:27,147 INFO L87 Difference]: Start difference. First operand 31998 states and 170450 transitions. Second operand 5 states. [2020-10-11 15:16:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:27,526 INFO L93 Difference]: Finished difference Result 56734 states and 290623 transitions. [2020-10-11 15:16:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:16:27,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-10-11 15:16:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:27,706 INFO L225 Difference]: With dead ends: 56734 [2020-10-11 15:16:27,706 INFO L226 Difference]: Without dead ends: 56671 [2020-10-11 15:16:27,706 INFO L673 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-10-11 15:16:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56671 states. [2020-10-11 15:16:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56671 to 40400. [2020-10-11 15:16:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40400 states. [2020-10-11 15:16:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40400 states to 40400 states and 215336 transitions. [2020-10-11 15:16:29,363 INFO L78 Accepts]: Start accepts. Automaton has 40400 states and 215336 transitions. Word has length 25 [2020-10-11 15:16:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:29,364 INFO L481 AbstractCegarLoop]: Abstraction has 40400 states and 215336 transitions. [2020-10-11 15:16:29,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:16:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 40400 states and 215336 transitions. [2020-10-11 15:16:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:29,366 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:29,366 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:29,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2020-10-11 15:16:29,366 INFO L429 AbstractCegarLoop]: === Iteration 39 === [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-10-11 15:16:29,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:29,367 INFO L82 PathProgramCache]: Analyzing trace with hash -670679464, now seen corresponding path program 5 times [2020-10-11 15:16:29,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:29,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392437161] [2020-10-11 15:16:29,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:29,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392437161] [2020-10-11 15:16:29,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:29,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:29,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037731344] [2020-10-11 15:16:29,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:29,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:29,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:29,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:29,952 INFO L87 Difference]: Start difference. First operand 40400 states and 215336 transitions. Second operand 9 states. [2020-10-11 15:16:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:31,237 INFO L93 Difference]: Finished difference Result 137449 states and 636138 transitions. [2020-10-11 15:16:31,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:31,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:31,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:31,668 INFO L225 Difference]: With dead ends: 137449 [2020-10-11 15:16:31,668 INFO L226 Difference]: Without dead ends: 137407 [2020-10-11 15:16:31,668 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137407 states. [2020-10-11 15:16:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137407 to 39840. [2020-10-11 15:16:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39840 states. [2020-10-11 15:16:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39840 states to 39840 states and 212294 transitions. [2020-10-11 15:16:34,679 INFO L78 Accepts]: Start accepts. Automaton has 39840 states and 212294 transitions. Word has length 25 [2020-10-11 15:16:34,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:34,679 INFO L481 AbstractCegarLoop]: Abstraction has 39840 states and 212294 transitions. [2020-10-11 15:16:34,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 39840 states and 212294 transitions. [2020-10-11 15:16:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:34,682 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:34,682 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:34,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2020-10-11 15:16:34,682 INFO L429 AbstractCegarLoop]: === Iteration 40 === [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-10-11 15:16:34,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:34,682 INFO L82 PathProgramCache]: Analyzing trace with hash -669338869, now seen corresponding path program 5 times [2020-10-11 15:16:34,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:34,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645452344] [2020-10-11 15:16:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:34,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:34,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645452344] [2020-10-11 15:16:34,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:34,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:34,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327674738] [2020-10-11 15:16:34,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:34,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:34,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:34,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:34,733 INFO L87 Difference]: Start difference. First operand 39840 states and 212294 transitions. Second operand 9 states. [2020-10-11 15:16:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:35,945 INFO L93 Difference]: Finished difference Result 136260 states and 629977 transitions. [2020-10-11 15:16:35,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:35,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:36,364 INFO L225 Difference]: With dead ends: 136260 [2020-10-11 15:16:36,364 INFO L226 Difference]: Without dead ends: 136218 [2020-10-11 15:16:36,364 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136218 states. [2020-10-11 15:16:40,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136218 to 39457. [2020-10-11 15:16:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39457 states. [2020-10-11 15:16:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39457 states to 39457 states and 210241 transitions. [2020-10-11 15:16:40,300 INFO L78 Accepts]: Start accepts. Automaton has 39457 states and 210241 transitions. Word has length 25 [2020-10-11 15:16:40,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:40,301 INFO L481 AbstractCegarLoop]: Abstraction has 39457 states and 210241 transitions. [2020-10-11 15:16:40,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:40,301 INFO L276 IsEmpty]: Start isEmpty. Operand 39457 states and 210241 transitions. [2020-10-11 15:16:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:40,304 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:40,304 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:40,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2020-10-11 15:16:40,304 INFO L429 AbstractCegarLoop]: === Iteration 41 === [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-10-11 15:16:40,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:40,305 INFO L82 PathProgramCache]: Analyzing trace with hash -684190504, now seen corresponding path program 6 times [2020-10-11 15:16:40,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:40,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045049739] [2020-10-11 15:16:40,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:40,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045049739] [2020-10-11 15:16:40,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:40,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:40,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246948792] [2020-10-11 15:16:40,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:40,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:40,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:40,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:40,359 INFO L87 Difference]: Start difference. First operand 39457 states and 210241 transitions. Second operand 9 states. [2020-10-11 15:16:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:41,581 INFO L93 Difference]: Finished difference Result 135358 states and 625465 transitions. [2020-10-11 15:16:41,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:41,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:41,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:41,987 INFO L225 Difference]: With dead ends: 135358 [2020-10-11 15:16:41,987 INFO L226 Difference]: Without dead ends: 135306 [2020-10-11 15:16:41,987 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135306 states. [2020-10-11 15:16:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135306 to 38674. [2020-10-11 15:16:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38674 states. [2020-10-11 15:16:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38674 states to 38674 states and 206150 transitions. [2020-10-11 15:16:44,915 INFO L78 Accepts]: Start accepts. Automaton has 38674 states and 206150 transitions. Word has length 25 [2020-10-11 15:16:44,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:44,916 INFO L481 AbstractCegarLoop]: Abstraction has 38674 states and 206150 transitions. [2020-10-11 15:16:44,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 38674 states and 206150 transitions. [2020-10-11 15:16:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:44,918 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:44,918 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:44,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2020-10-11 15:16:44,918 INFO L429 AbstractCegarLoop]: === Iteration 42 === [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-10-11 15:16:44,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:44,918 INFO L82 PathProgramCache]: Analyzing trace with hash -684189109, now seen corresponding path program 6 times [2020-10-11 15:16:44,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:44,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112810226] [2020-10-11 15:16:44,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:44,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112810226] [2020-10-11 15:16:44,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:44,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:44,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122286213] [2020-10-11 15:16:44,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:44,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:44,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:44,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:44,964 INFO L87 Difference]: Start difference. First operand 38674 states and 206150 transitions. Second operand 9 states. [2020-10-11 15:16:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:46,186 INFO L93 Difference]: Finished difference Result 134089 states and 619317 transitions. [2020-10-11 15:16:46,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:46,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:46,592 INFO L225 Difference]: With dead ends: 134089 [2020-10-11 15:16:46,592 INFO L226 Difference]: Without dead ends: 134037 [2020-10-11 15:16:46,592 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134037 states. [2020-10-11 15:16:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134037 to 37675. [2020-10-11 15:16:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37675 states. [2020-10-11 15:16:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37675 states to 37675 states and 201015 transitions. [2020-10-11 15:16:50,346 INFO L78 Accepts]: Start accepts. Automaton has 37675 states and 201015 transitions. Word has length 25 [2020-10-11 15:16:50,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:50,346 INFO L481 AbstractCegarLoop]: Abstraction has 37675 states and 201015 transitions. [2020-10-11 15:16:50,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 37675 states and 201015 transitions. [2020-10-11 15:16:50,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:16:50,349 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:50,349 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:50,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2020-10-11 15:16:50,350 INFO L429 AbstractCegarLoop]: === Iteration 43 === [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-10-11 15:16:50,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:50,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1444696671, now seen corresponding path program 1 times [2020-10-11 15:16:50,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:50,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339132365] [2020-10-11 15:16:50,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:16:50,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339132365] [2020-10-11 15:16:50,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500358144] [2020-10-11 15:16:50,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:16:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:50,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:16:50,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:16:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:16:50,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:16:50,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:16:50,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840641045] [2020-10-11 15:16:50,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:50,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:50,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:50,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:50,476 INFO L87 Difference]: Start difference. First operand 37675 states and 201015 transitions. Second operand 9 states. [2020-10-11 15:16:51,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:51,143 INFO L93 Difference]: Finished difference Result 85349 states and 414605 transitions. [2020-10-11 15:16:51,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:16:51,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-11 15:16:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:51,397 INFO L225 Difference]: With dead ends: 85349 [2020-10-11 15:16:51,397 INFO L226 Difference]: Without dead ends: 85301 [2020-10-11 15:16:51,397 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:16:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85301 states. [2020-10-11 15:16:53,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85301 to 38836. [2020-10-11 15:16:53,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38836 states. [2020-10-11 15:16:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38836 states to 38836 states and 206710 transitions. [2020-10-11 15:16:53,513 INFO L78 Accepts]: Start accepts. Automaton has 38836 states and 206710 transitions. Word has length 27 [2020-10-11 15:16:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:53,513 INFO L481 AbstractCegarLoop]: Abstraction has 38836 states and 206710 transitions. [2020-10-11 15:16:53,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 38836 states and 206710 transitions. [2020-10-11 15:16:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:16:53,517 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:53,517 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:53,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable117 [2020-10-11 15:16:53,718 INFO L429 AbstractCegarLoop]: === Iteration 44 === [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-10-11 15:16:53,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:53,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1707919879, now seen corresponding path program 1 times [2020-10-11 15:16:53,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:53,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141099793] [2020-10-11 15:16:53,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:16:53,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141099793] [2020-10-11 15:16:53,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519710386] [2020-10-11 15:16:53,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:16:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:53,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:16:53,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:16:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:16:53,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:16:53,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:16:53,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029070359] [2020-10-11 15:16:53,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:16:53,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:53,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:16:53,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:16:53,886 INFO L87 Difference]: Start difference. First operand 38836 states and 206710 transitions. Second operand 13 states. [2020-10-11 15:16:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:56,368 INFO L93 Difference]: Finished difference Result 184520 states and 806691 transitions. [2020-10-11 15:16:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:16:56,369 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:16:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:56,909 INFO L225 Difference]: With dead ends: 184520 [2020-10-11 15:16:56,909 INFO L226 Difference]: Without dead ends: 184502 [2020-10-11 15:16:56,909 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1606 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:16:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184502 states. [2020-10-11 15:17:01,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184502 to 38937. [2020-10-11 15:17:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38937 states. [2020-10-11 15:17:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38937 states to 38937 states and 207195 transitions. [2020-10-11 15:17:01,577 INFO L78 Accepts]: Start accepts. Automaton has 38937 states and 207195 transitions. Word has length 27 [2020-10-11 15:17:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:01,578 INFO L481 AbstractCegarLoop]: Abstraction has 38937 states and 207195 transitions. [2020-10-11 15:17:01,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 38937 states and 207195 transitions. [2020-10-11 15:17:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:01,581 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:01,582 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:01,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2020-10-11 15:17:01,782 INFO L429 AbstractCegarLoop]: === Iteration 45 === [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-10-11 15:17:01,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:01,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1671880519, now seen corresponding path program 2 times [2020-10-11 15:17:01,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:01,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346553569] [2020-10-11 15:17:01,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:01,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346553569] [2020-10-11 15:17:01,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492888720] [2020-10-11 15:17:01,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:01,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:17:01,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:17:01,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:01,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:01,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:01,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:01,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304489545] [2020-10-11 15:17:01,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:01,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:01,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:01,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:01,960 INFO L87 Difference]: Start difference. First operand 38937 states and 207195 transitions. Second operand 13 states. [2020-10-11 15:17:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:04,460 INFO L93 Difference]: Finished difference Result 184111 states and 804949 transitions. [2020-10-11 15:17:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:04,461 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:04,990 INFO L225 Difference]: With dead ends: 184111 [2020-10-11 15:17:04,990 INFO L226 Difference]: Without dead ends: 184087 [2020-10-11 15:17:04,990 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:17:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184087 states. [2020-10-11 15:17:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184087 to 38705. [2020-10-11 15:17:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38705 states. [2020-10-11 15:17:08,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38705 states to 38705 states and 205959 transitions. [2020-10-11 15:17:08,822 INFO L78 Accepts]: Start accepts. Automaton has 38705 states and 205959 transitions. Word has length 27 [2020-10-11 15:17:08,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:08,822 INFO L481 AbstractCegarLoop]: Abstraction has 38705 states and 205959 transitions. [2020-10-11 15:17:08,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:08,823 INFO L276 IsEmpty]: Start isEmpty. Operand 38705 states and 205959 transitions. [2020-10-11 15:17:08,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:08,827 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:08,827 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:09,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:09,027 INFO L429 AbstractCegarLoop]: === Iteration 46 === [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-10-11 15:17:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:09,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1200868665, now seen corresponding path program 3 times [2020-10-11 15:17:09,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:09,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529138225] [2020-10-11 15:17:09,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:09,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529138225] [2020-10-11 15:17:09,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391143506] [2020-10-11 15:17:09,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:09,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-11 15:17:09,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:17:09,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:09,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:09,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:09,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:09,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246241328] [2020-10-11 15:17:09,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:09,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:09,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:09,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:09,848 INFO L87 Difference]: Start difference. First operand 38705 states and 205959 transitions. Second operand 13 states. [2020-10-11 15:17:12,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:12,218 INFO L93 Difference]: Finished difference Result 183485 states and 802028 transitions. [2020-10-11 15:17:12,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:12,218 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:12,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:12,745 INFO L225 Difference]: With dead ends: 183485 [2020-10-11 15:17:12,745 INFO L226 Difference]: Without dead ends: 183467 [2020-10-11 15:17:12,746 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:17:14,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183467 states. [2020-10-11 15:17:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183467 to 38802. [2020-10-11 15:17:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38802 states. [2020-10-11 15:17:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38802 states to 38802 states and 206432 transitions. [2020-10-11 15:17:16,511 INFO L78 Accepts]: Start accepts. Automaton has 38802 states and 206432 transitions. Word has length 27 [2020-10-11 15:17:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:16,512 INFO L481 AbstractCegarLoop]: Abstraction has 38802 states and 206432 transitions. [2020-10-11 15:17:16,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 38802 states and 206432 transitions. [2020-10-11 15:17:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:16,517 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:16,517 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:16,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:16,733 INFO L429 AbstractCegarLoop]: === Iteration 47 === [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-10-11 15:17:16,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:16,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1222057785, now seen corresponding path program 4 times [2020-10-11 15:17:16,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:16,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880369059] [2020-10-11 15:17:16,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:16,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880369059] [2020-10-11 15:17:16,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269049656] [2020-10-11 15:17:16,803 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:16,889 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:17:16,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:17:16,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:16,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:16,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:16,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:16,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330966323] [2020-10-11 15:17:16,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:16,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:16,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:16,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:16,913 INFO L87 Difference]: Start difference. First operand 38802 states and 206432 transitions. Second operand 13 states. [2020-10-11 15:17:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:20,131 INFO L93 Difference]: Finished difference Result 183194 states and 800691 transitions. [2020-10-11 15:17:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:20,132 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:20,696 INFO L225 Difference]: With dead ends: 183194 [2020-10-11 15:17:20,696 INFO L226 Difference]: Without dead ends: 183170 [2020-10-11 15:17:20,697 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1607 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:17:22,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183170 states. [2020-10-11 15:17:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183170 to 38578. [2020-10-11 15:17:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38578 states. [2020-10-11 15:17:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38578 states to 38578 states and 205224 transitions. [2020-10-11 15:17:24,336 INFO L78 Accepts]: Start accepts. Automaton has 38578 states and 205224 transitions. Word has length 27 [2020-10-11 15:17:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:24,337 INFO L481 AbstractCegarLoop]: Abstraction has 38578 states and 205224 transitions. [2020-10-11 15:17:24,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 38578 states and 205224 transitions. [2020-10-11 15:17:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:24,340 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:24,340 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:24,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:24,541 INFO L429 AbstractCegarLoop]: === Iteration 48 === [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-10-11 15:17:24,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:24,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1510994617, now seen corresponding path program 5 times [2020-10-11 15:17:24,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:24,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856337738] [2020-10-11 15:17:24,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:24,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856337738] [2020-10-11 15:17:24,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133052419] [2020-10-11 15:17:24,609 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:24,700 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-10-11 15:17:24,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:17:24,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:24,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:24,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:24,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:24,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640643914] [2020-10-11 15:17:24,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:24,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:24,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:24,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:24,726 INFO L87 Difference]: Start difference. First operand 38578 states and 205224 transitions. Second operand 13 states. [2020-10-11 15:17:27,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:27,277 INFO L93 Difference]: Finished difference Result 182584 states and 797818 transitions. [2020-10-11 15:17:27,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:27,277 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:27,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:27,800 INFO L225 Difference]: With dead ends: 182584 [2020-10-11 15:17:27,801 INFO L226 Difference]: Without dead ends: 182566 [2020-10-11 15:17:27,801 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:17:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182566 states. [2020-10-11 15:17:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182566 to 38683. [2020-10-11 15:17:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38683 states. [2020-10-11 15:17:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38683 states to 38683 states and 205717 transitions. [2020-10-11 15:17:32,368 INFO L78 Accepts]: Start accepts. Automaton has 38683 states and 205717 transitions. Word has length 27 [2020-10-11 15:17:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:32,368 INFO L481 AbstractCegarLoop]: Abstraction has 38683 states and 205717 transitions. [2020-10-11 15:17:32,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 38683 states and 205717 transitions. [2020-10-11 15:17:32,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:32,372 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:32,372 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:32,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2020-10-11 15:17:32,573 INFO L429 AbstractCegarLoop]: === Iteration 49 === [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-10-11 15:17:32,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:32,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1496144377, now seen corresponding path program 6 times [2020-10-11 15:17:32,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:32,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437753005] [2020-10-11 15:17:32,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:32,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437753005] [2020-10-11 15:17:32,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092176933] [2020-10-11 15:17:32,643 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:32,734 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2020-10-11 15:17:32,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:17:32,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:32,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:32,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:32,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:32,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195493219] [2020-10-11 15:17:32,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:32,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:32,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:32,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:32,758 INFO L87 Difference]: Start difference. First operand 38683 states and 205717 transitions. Second operand 13 states. [2020-10-11 15:17:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:35,093 INFO L93 Difference]: Finished difference Result 182167 states and 796056 transitions. [2020-10-11 15:17:35,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:35,094 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:35,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:35,619 INFO L225 Difference]: With dead ends: 182167 [2020-10-11 15:17:35,619 INFO L226 Difference]: Without dead ends: 182139 [2020-10-11 15:17:35,620 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:17:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182139 states. [2020-10-11 15:17:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182139 to 38439. [2020-10-11 15:17:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38439 states. [2020-10-11 15:17:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38439 states to 38439 states and 204452 transitions. [2020-10-11 15:17:40,459 INFO L78 Accepts]: Start accepts. Automaton has 38439 states and 204452 transitions. Word has length 27 [2020-10-11 15:17:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:40,459 INFO L481 AbstractCegarLoop]: Abstraction has 38439 states and 204452 transitions. [2020-10-11 15:17:40,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 38439 states and 204452 transitions. [2020-10-11 15:17:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:40,463 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:40,463 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:40,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2020-10-11 15:17:40,664 INFO L429 AbstractCegarLoop]: === Iteration 50 === [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-10-11 15:17:40,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:40,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1123724041, now seen corresponding path program 7 times [2020-10-11 15:17:40,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:40,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751546852] [2020-10-11 15:17:40,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:40,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:17:40,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751546852] [2020-10-11 15:17:40,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556203374] [2020-10-11 15:17:40,731 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:40,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:40,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:17:40,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:40,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:40,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002472486] [2020-10-11 15:17:40,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:40,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:40,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:40,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:40,836 INFO L87 Difference]: Start difference. First operand 38439 states and 204452 transitions. Second operand 13 states. [2020-10-11 15:17:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:43,235 INFO L93 Difference]: Finished difference Result 183258 states and 800935 transitions. [2020-10-11 15:17:43,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:43,236 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:43,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:43,756 INFO L225 Difference]: With dead ends: 183258 [2020-10-11 15:17:43,756 INFO L226 Difference]: Without dead ends: 183240 [2020-10-11 15:17:43,757 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1606 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:17:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183240 states. [2020-10-11 15:17:47,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183240 to 38278. [2020-10-11 15:17:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38278 states. [2020-10-11 15:17:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38278 states to 38278 states and 203659 transitions. [2020-10-11 15:17:47,502 INFO L78 Accepts]: Start accepts. Automaton has 38278 states and 203659 transitions. Word has length 27 [2020-10-11 15:17:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:47,502 INFO L481 AbstractCegarLoop]: Abstraction has 38278 states and 203659 transitions. [2020-10-11 15:17:47,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 38278 states and 203659 transitions. [2020-10-11 15:17:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:47,506 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:47,506 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:47,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2020-10-11 15:17:47,707 INFO L429 AbstractCegarLoop]: === Iteration 51 === [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-10-11 15:17:47,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:47,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1087684681, now seen corresponding path program 8 times [2020-10-11 15:17:47,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:47,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974926703] [2020-10-11 15:17:47,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:17:47,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974926703] [2020-10-11 15:17:47,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18312181] [2020-10-11 15:17:47,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:47,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:17:47,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:17:47,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:47,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:17:47,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:47,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:47,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462801217] [2020-10-11 15:17:47,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:47,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:47,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:47,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:47,889 INFO L87 Difference]: Start difference. First operand 38278 states and 203659 transitions. Second operand 13 states. [2020-10-11 15:17:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:50,899 INFO L93 Difference]: Finished difference Result 182849 states and 799193 transitions. [2020-10-11 15:17:50,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:50,900 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:51,419 INFO L225 Difference]: With dead ends: 182849 [2020-10-11 15:17:51,420 INFO L226 Difference]: Without dead ends: 182825 [2020-10-11 15:17:51,420 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:17:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182825 states. [2020-10-11 15:17:54,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182825 to 37884. [2020-10-11 15:17:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37884 states. [2020-10-11 15:17:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37884 states to 37884 states and 201622 transitions. [2020-10-11 15:17:55,070 INFO L78 Accepts]: Start accepts. Automaton has 37884 states and 201622 transitions. Word has length 27 [2020-10-11 15:17:55,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:55,070 INFO L481 AbstractCegarLoop]: Abstraction has 37884 states and 201622 transitions. [2020-10-11 15:17:55,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 37884 states and 201622 transitions. [2020-10-11 15:17:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:55,074 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:55,074 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:55,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2020-10-11 15:17:55,275 INFO L429 AbstractCegarLoop]: === Iteration 52 === [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-10-11 15:17:55,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:55,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2028959203, now seen corresponding path program 9 times [2020-10-11 15:17:55,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:55,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870467735] [2020-10-11 15:17:55,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:55,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:17:55,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870467735] [2020-10-11 15:17:55,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663229032] [2020-10-11 15:17:55,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:55,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:17:55,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:17:55,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:55,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:17:55,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:55,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:55,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630013427] [2020-10-11 15:17:55,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:55,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:55,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:55,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:55,461 INFO L87 Difference]: Start difference. First operand 37884 states and 201622 transitions. Second operand 13 states. [2020-10-11 15:17:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:57,973 INFO L93 Difference]: Finished difference Result 183773 states and 803153 transitions. [2020-10-11 15:17:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:57,973 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:58,519 INFO L225 Difference]: With dead ends: 183773 [2020-10-11 15:17:58,519 INFO L226 Difference]: Without dead ends: 183755 [2020-10-11 15:17:58,519 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1612 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:18:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183755 states. [2020-10-11 15:18:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183755 to 37981. [2020-10-11 15:18:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37981 states. [2020-10-11 15:18:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37981 states to 37981 states and 202095 transitions. [2020-10-11 15:18:02,893 INFO L78 Accepts]: Start accepts. Automaton has 37981 states and 202095 transitions. Word has length 27 [2020-10-11 15:18:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:02,893 INFO L481 AbstractCegarLoop]: Abstraction has 37981 states and 202095 transitions. [2020-10-11 15:18:02,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:18:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 37981 states and 202095 transitions. [2020-10-11 15:18:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:02,898 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:02,898 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:03,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2020-10-11 15:18:03,113 INFO L429 AbstractCegarLoop]: === Iteration 53 === [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-10-11 15:18:03,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:03,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2051487523, now seen corresponding path program 10 times [2020-10-11 15:18:03,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:03,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736264000] [2020-10-11 15:18:03,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:18:03,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736264000] [2020-10-11 15:18:03,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008207960] [2020-10-11 15:18:03,185 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:18:03,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:18:03,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:18:03,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:18:03,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:18:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:18:03,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:18:03,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:18:03,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19906937] [2020-10-11 15:18:03,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:18:03,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:03,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:18:03,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:18:03,300 INFO L87 Difference]: Start difference. First operand 37981 states and 202095 transitions. Second operand 13 states. [2020-10-11 15:18:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:05,814 INFO L93 Difference]: Finished difference Result 184574 states and 806606 transitions. [2020-10-11 15:18:05,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:18:05,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:18:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:06,353 INFO L225 Difference]: With dead ends: 184574 [2020-10-11 15:18:06,353 INFO L226 Difference]: Without dead ends: 184550 [2020-10-11 15:18:06,354 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1612 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:18:07,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184550 states. [2020-10-11 15:18:10,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184550 to 37723. [2020-10-11 15:18:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37723 states. [2020-10-11 15:18:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37723 states to 37723 states and 200669 transitions. [2020-10-11 15:18:11,020 INFO L78 Accepts]: Start accepts. Automaton has 37723 states and 200669 transitions. Word has length 27 [2020-10-11 15:18:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:11,021 INFO L481 AbstractCegarLoop]: Abstraction has 37723 states and 200669 transitions. [2020-10-11 15:18:11,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:18:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 37723 states and 200669 transitions. [2020-10-11 15:18:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:11,025 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:11,025 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:11,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:18:11,231 INFO L429 AbstractCegarLoop]: === Iteration 54 === [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-10-11 15:18:11,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:11,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1310776872, now seen corresponding path program 1 times [2020-10-11 15:18:11,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:11,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68668820] [2020-10-11 15:18:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:18:11,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68668820] [2020-10-11 15:18:11,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773791062] [2020-10-11 15:18:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:18:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:11,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:18:11,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:18:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:18:11,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:18:11,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:18:11,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435237486] [2020-10-11 15:18:11,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:18:11,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:11,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:18:11,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:18:11,374 INFO L87 Difference]: Start difference. First operand 37723 states and 200669 transitions. Second operand 9 states. [2020-10-11 15:18:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:12,038 INFO L93 Difference]: Finished difference Result 87418 states and 424333 transitions. [2020-10-11 15:18:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:18:12,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-11 15:18:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:12,314 INFO L225 Difference]: With dead ends: 87418 [2020-10-11 15:18:12,315 INFO L226 Difference]: Without dead ends: 87366 [2020-10-11 15:18:12,315 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:18:13,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87366 states. [2020-10-11 15:18:14,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87366 to 39181. [2020-10-11 15:18:14,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39181 states. [2020-10-11 15:18:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39181 states to 39181 states and 208301 transitions. [2020-10-11 15:18:14,461 INFO L78 Accepts]: Start accepts. Automaton has 39181 states and 208301 transitions. Word has length 27 [2020-10-11 15:18:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:14,461 INFO L481 AbstractCegarLoop]: Abstraction has 39181 states and 208301 transitions. [2020-10-11 15:18:14,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:18:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 39181 states and 208301 transitions. [2020-10-11 15:18:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:14,465 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:14,465 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:14,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2020-10-11 15:18:14,666 INFO L429 AbstractCegarLoop]: === Iteration 55 === [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-10-11 15:18:14,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:14,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1955882141, now seen corresponding path program 11 times [2020-10-11 15:18:14,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:14,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193971984] [2020-10-11 15:18:14,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:18:14,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193971984] [2020-10-11 15:18:14,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578663916] [2020-10-11 15:18:14,737 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:18:14,825 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-10-11 15:18:14,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:18:14,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:18:14,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:18:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:18:14,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:18:14,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:18:14,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116639996] [2020-10-11 15:18:14,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:18:14,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:14,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:18:14,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:18:14,850 INFO L87 Difference]: Start difference. First operand 39181 states and 208301 transitions. Second operand 13 states. [2020-10-11 15:18:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:17,220 INFO L93 Difference]: Finished difference Result 181204 states and 790360 transitions. [2020-10-11 15:18:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:18:17,222 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:18:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:17,768 INFO L225 Difference]: With dead ends: 181204 [2020-10-11 15:18:17,769 INFO L226 Difference]: Without dead ends: 181186 [2020-10-11 15:18:17,769 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:18:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181186 states. [2020-10-11 15:18:21,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181186 to 39282. [2020-10-11 15:18:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39282 states. [2020-10-11 15:18:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39282 states to 39282 states and 208786 transitions. [2020-10-11 15:18:22,054 INFO L78 Accepts]: Start accepts. Automaton has 39282 states and 208786 transitions. Word has length 27 [2020-10-11 15:18:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:22,054 INFO L481 AbstractCegarLoop]: Abstraction has 39282 states and 208786 transitions. [2020-10-11 15:18:22,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:18:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 39282 states and 208786 transitions. [2020-10-11 15:18:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:22,058 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:22,058 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:22,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129,58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:18:22,259 INFO L429 AbstractCegarLoop]: === Iteration 56 === [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-10-11 15:18:22,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1969393181, now seen corresponding path program 12 times [2020-10-11 15:18:22,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:22,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126269957] [2020-10-11 15:18:22,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:18:22,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126269957] [2020-10-11 15:18:22,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040627149] [2020-10-11 15:18:22,328 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:18:22,417 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2020-10-11 15:18:22,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:18:22,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:18:22,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:18:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:18:22,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:18:22,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:18:22,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561854403] [2020-10-11 15:18:22,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:18:22,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:22,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:18:22,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:18:22,440 INFO L87 Difference]: Start difference. First operand 39282 states and 208786 transitions. Second operand 13 states. [2020-10-11 15:18:24,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:24,866 INFO L93 Difference]: Finished difference Result 181788 states and 792986 transitions. [2020-10-11 15:18:24,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:18:24,867 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:18:24,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:25,406 INFO L225 Difference]: With dead ends: 181788 [2020-10-11 15:18:25,406 INFO L226 Difference]: Without dead ends: 181760 [2020-10-11 15:18:25,407 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1606 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:18:26,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181760 states. [2020-10-11 15:18:29,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181760 to 39046. [2020-10-11 15:18:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39046 states. [2020-10-11 15:18:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39046 states to 39046 states and 207541 transitions. [2020-10-11 15:18:29,989 INFO L78 Accepts]: Start accepts. Automaton has 39046 states and 207541 transitions. Word has length 27 [2020-10-11 15:18:29,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:29,989 INFO L481 AbstractCegarLoop]: Abstraction has 39046 states and 207541 transitions. [2020-10-11 15:18:29,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:18:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 39046 states and 207541 transitions. [2020-10-11 15:18:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:29,995 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:29,995 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:30,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable130 [2020-10-11 15:18:30,211 INFO L429 AbstractCegarLoop]: === Iteration 57 === [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-10-11 15:18:30,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1977356605, now seen corresponding path program 13 times [2020-10-11 15:18:30,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:30,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956099952] [2020-10-11 15:18:30,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:30,274 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:18:30,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956099952] [2020-10-11 15:18:30,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:18:30,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:18:30,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511962781] [2020-10-11 15:18:30,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:18:30,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:30,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:18:30,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:18:30,275 INFO L87 Difference]: Start difference. First operand 39046 states and 207541 transitions. Second operand 11 states. [2020-10-11 15:18:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:32,703 INFO L93 Difference]: Finished difference Result 182119 states and 794828 transitions. [2020-10-11 15:18:32,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:18:32,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:18:32,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:33,228 INFO L225 Difference]: With dead ends: 182119 [2020-10-11 15:18:33,228 INFO L226 Difference]: Without dead ends: 182101 [2020-10-11 15:18:33,228 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:18:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182101 states. [2020-10-11 15:18:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182101 to 38885. [2020-10-11 15:18:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38885 states. [2020-10-11 15:18:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38885 states to 38885 states and 206748 transitions. [2020-10-11 15:18:36,956 INFO L78 Accepts]: Start accepts. Automaton has 38885 states and 206748 transitions. Word has length 27 [2020-10-11 15:18:36,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:36,956 INFO L481 AbstractCegarLoop]: Abstraction has 38885 states and 206748 transitions. [2020-10-11 15:18:36,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:18:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 38885 states and 206748 transitions. [2020-10-11 15:18:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:36,961 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:36,961 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:36,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2020-10-11 15:18:36,961 INFO L429 AbstractCegarLoop]: === Iteration 58 === [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-10-11 15:18:36,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:36,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1956167485, now seen corresponding path program 14 times [2020-10-11 15:18:36,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:36,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507918450] [2020-10-11 15:18:36,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:18:37,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507918450] [2020-10-11 15:18:37,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:18:37,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:18:37,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291668434] [2020-10-11 15:18:37,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:18:37,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:37,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:18:37,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:18:37,033 INFO L87 Difference]: Start difference. First operand 38885 states and 206748 transitions. Second operand 11 states. [2020-10-11 15:18:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:39,823 INFO L93 Difference]: Finished difference Result 182770 states and 797712 transitions. [2020-10-11 15:18:39,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:18:39,824 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:18:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:40,363 INFO L225 Difference]: With dead ends: 182770 [2020-10-11 15:18:40,363 INFO L226 Difference]: Without dead ends: 182746 [2020-10-11 15:18:40,364 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1559 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:18:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182746 states. [2020-10-11 15:18:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182746 to 38499. [2020-10-11 15:18:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38499 states. [2020-10-11 15:18:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38499 states to 38499 states and 204735 transitions. [2020-10-11 15:18:44,005 INFO L78 Accepts]: Start accepts. Automaton has 38499 states and 204735 transitions. Word has length 27 [2020-10-11 15:18:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:44,006 INFO L481 AbstractCegarLoop]: Abstraction has 38499 states and 204735 transitions. [2020-10-11 15:18:44,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:18:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 38499 states and 204735 transitions. [2020-10-11 15:18:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:44,010 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:44,010 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:44,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2020-10-11 15:18:44,011 INFO L429 AbstractCegarLoop]: === Iteration 59 === [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-10-11 15:18:44,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:44,011 INFO L82 PathProgramCache]: Analyzing trace with hash -690385405, now seen corresponding path program 15 times [2020-10-11 15:18:44,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:44,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932640807] [2020-10-11 15:18:44,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:18:44,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932640807] [2020-10-11 15:18:44,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:18:44,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:18:44,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736129969] [2020-10-11 15:18:44,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:18:44,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:44,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:18:44,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:18:44,080 INFO L87 Difference]: Start difference. First operand 38499 states and 204735 transitions. Second operand 11 states. [2020-10-11 15:18:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:46,452 INFO L93 Difference]: Finished difference Result 181153 states and 790470 transitions. [2020-10-11 15:18:46,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:18:46,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:18:46,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:46,980 INFO L225 Difference]: With dead ends: 181153 [2020-10-11 15:18:46,980 INFO L226 Difference]: Without dead ends: 181135 [2020-10-11 15:18:46,980 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1561 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:18:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181135 states. [2020-10-11 15:18:51,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181135 to 38208. [2020-10-11 15:18:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38208 states. [2020-10-11 15:18:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38208 states to 38208 states and 203398 transitions. [2020-10-11 15:18:51,152 INFO L78 Accepts]: Start accepts. Automaton has 38208 states and 203398 transitions. Word has length 27 [2020-10-11 15:18:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:51,153 INFO L481 AbstractCegarLoop]: Abstraction has 38208 states and 203398 transitions. [2020-10-11 15:18:51,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:18:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 38208 states and 203398 transitions. [2020-10-11 15:18:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:51,157 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:51,157 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:51,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2020-10-11 15:18:51,157 INFO L429 AbstractCegarLoop]: === Iteration 60 === [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-10-11 15:18:51,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:51,157 INFO L82 PathProgramCache]: Analyzing trace with hash -667857085, now seen corresponding path program 16 times [2020-10-11 15:18:51,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:51,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102377958] [2020-10-11 15:18:51,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:18:51,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102377958] [2020-10-11 15:18:51,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:18:51,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:18:51,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116511506] [2020-10-11 15:18:51,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:18:51,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:51,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:18:51,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:18:51,228 INFO L87 Difference]: Start difference. First operand 38208 states and 203398 transitions. Second operand 11 states. [2020-10-11 15:18:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:53,593 INFO L93 Difference]: Finished difference Result 181957 states and 793915 transitions. [2020-10-11 15:18:53,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:18:53,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:18:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:54,120 INFO L225 Difference]: With dead ends: 181957 [2020-10-11 15:18:54,120 INFO L226 Difference]: Without dead ends: 181933 [2020-10-11 15:18:54,121 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:18:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181933 states. [2020-10-11 15:18:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181933 to 37822. [2020-10-11 15:18:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37822 states. [2020-10-11 15:18:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37822 states to 37822 states and 201385 transitions. [2020-10-11 15:18:58,630 INFO L78 Accepts]: Start accepts. Automaton has 37822 states and 201385 transitions. Word has length 27 [2020-10-11 15:18:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:58,630 INFO L481 AbstractCegarLoop]: Abstraction has 37822 states and 201385 transitions. [2020-10-11 15:18:58,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:18:58,630 INFO L276 IsEmpty]: Start isEmpty. Operand 37822 states and 201385 transitions. [2020-10-11 15:18:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:58,634 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:58,634 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:58,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2020-10-11 15:18:58,634 INFO L429 AbstractCegarLoop]: === Iteration 61 === [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-10-11 15:18:58,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:58,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1485355099, now seen corresponding path program 1 times [2020-10-11 15:18:58,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:58,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525411773] [2020-10-11 15:18:58,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:18:58,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525411773] [2020-10-11 15:18:58,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777296983] [2020-10-11 15:18:58,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:18:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:58,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:18:58,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:18:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:18:58,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:18:58,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:18:58,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355056261] [2020-10-11 15:18:58,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:18:58,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:58,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:18:58,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:18:58,798 INFO L87 Difference]: Start difference. First operand 37822 states and 201385 transitions. Second operand 9 states. [2020-10-11 15:18:59,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:59,495 INFO L93 Difference]: Finished difference Result 90020 states and 438095 transitions. [2020-10-11 15:18:59,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:18:59,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-11 15:18:59,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:59,778 INFO L225 Difference]: With dead ends: 90020 [2020-10-11 15:18:59,778 INFO L226 Difference]: Without dead ends: 89960 [2020-10-11 15:18:59,778 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 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-10-11 15:19:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89960 states. [2020-10-11 15:19:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89960 to 39411. [2020-10-11 15:19:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39411 states. [2020-10-11 15:19:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39411 states to 39411 states and 210063 transitions. [2020-10-11 15:19:01,972 INFO L78 Accepts]: Start accepts. Automaton has 39411 states and 210063 transitions. Word has length 27 [2020-10-11 15:19:01,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:01,972 INFO L481 AbstractCegarLoop]: Abstraction has 39411 states and 210063 transitions. [2020-10-11 15:19:01,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:19:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 39411 states and 210063 transitions. [2020-10-11 15:19:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:01,977 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:01,977 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:02,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2020-10-11 15:19:02,178 INFO L429 AbstractCegarLoop]: === Iteration 62 === [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-10-11 15:19:02,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:02,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1781288445, now seen corresponding path program 17 times [2020-10-11 15:19:02,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:02,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113578705] [2020-10-11 15:19:02,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:19:02,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113578705] [2020-10-11 15:19:02,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:02,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:19:02,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38768946] [2020-10-11 15:19:02,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:19:02,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:02,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:19:02,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:19:02,255 INFO L87 Difference]: Start difference. First operand 39411 states and 210063 transitions. Second operand 11 states. [2020-10-11 15:19:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:04,643 INFO L93 Difference]: Finished difference Result 181463 states and 790579 transitions. [2020-10-11 15:19:04,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:19:04,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:19:04,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:05,171 INFO L225 Difference]: With dead ends: 181463 [2020-10-11 15:19:05,171 INFO L226 Difference]: Without dead ends: 181445 [2020-10-11 15:19:05,171 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:19:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181445 states. [2020-10-11 15:19:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181445 to 39508. [2020-10-11 15:19:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39508 states. [2020-10-11 15:19:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39508 states to 39508 states and 210536 transitions. [2020-10-11 15:19:09,525 INFO L78 Accepts]: Start accepts. Automaton has 39508 states and 210536 transitions. Word has length 27 [2020-10-11 15:19:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:09,525 INFO L481 AbstractCegarLoop]: Abstraction has 39508 states and 210536 transitions. [2020-10-11 15:19:09,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:19:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 39508 states and 210536 transitions. [2020-10-11 15:19:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:09,529 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:09,530 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:09,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2020-10-11 15:19:09,530 INFO L429 AbstractCegarLoop]: === Iteration 63 === [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-10-11 15:19:09,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:09,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1779949245, now seen corresponding path program 18 times [2020-10-11 15:19:09,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:09,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311944962] [2020-10-11 15:19:09,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:19:09,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311944962] [2020-10-11 15:19:09,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:09,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:19:09,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932832607] [2020-10-11 15:19:09,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:19:09,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:09,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:19:09,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:19:09,601 INFO L87 Difference]: Start difference. First operand 39508 states and 210536 transitions. Second operand 11 states. [2020-10-11 15:19:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:12,087 INFO L93 Difference]: Finished difference Result 181054 states and 788837 transitions. [2020-10-11 15:19:12,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:19:12,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:19:12,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:12,614 INFO L225 Difference]: With dead ends: 181054 [2020-10-11 15:19:12,614 INFO L226 Difference]: Without dead ends: 181026 [2020-10-11 15:19:12,615 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:19:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181026 states. [2020-10-11 15:19:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181026 to 39280. [2020-10-11 15:19:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2020-10-11 15:19:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 209319 transitions. [2020-10-11 15:19:17,248 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 209319 transitions. Word has length 27 [2020-10-11 15:19:17,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:17,249 INFO L481 AbstractCegarLoop]: Abstraction has 39280 states and 209319 transitions. [2020-10-11 15:19:17,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:19:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 209319 transitions. [2020-10-11 15:19:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:17,253 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:17,254 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:17,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2020-10-11 15:19:17,254 INFO L429 AbstractCegarLoop]: === Iteration 64 === [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-10-11 15:19:17,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:17,254 INFO L82 PathProgramCache]: Analyzing trace with hash -639654315, now seen corresponding path program 2 times [2020-10-11 15:19:17,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:17,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002984729] [2020-10-11 15:19:17,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:19:17,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002984729] [2020-10-11 15:19:17,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:17,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:19:17,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588072839] [2020-10-11 15:19:17,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:19:17,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:17,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:19:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:19:17,287 INFO L87 Difference]: Start difference. First operand 39280 states and 209319 transitions. Second operand 7 states. [2020-10-11 15:19:17,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:17,990 INFO L93 Difference]: Finished difference Result 90032 states and 438659 transitions. [2020-10-11 15:19:17,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:19:17,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-11 15:19:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:18,263 INFO L225 Difference]: With dead ends: 90032 [2020-10-11 15:19:18,263 INFO L226 Difference]: Without dead ends: 89955 [2020-10-11 15:19:18,263 INFO L673 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-10-11 15:19:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89955 states. [2020-10-11 15:19:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89955 to 40208. [2020-10-11 15:19:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40208 states. [2020-10-11 15:19:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40208 states to 40208 states and 214272 transitions. [2020-10-11 15:19:20,414 INFO L78 Accepts]: Start accepts. Automaton has 40208 states and 214272 transitions. Word has length 27 [2020-10-11 15:19:20,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:20,415 INFO L481 AbstractCegarLoop]: Abstraction has 40208 states and 214272 transitions. [2020-10-11 15:19:20,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:19:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 40208 states and 214272 transitions. [2020-10-11 15:19:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:20,419 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:20,420 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:20,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2020-10-11 15:19:20,420 INFO L429 AbstractCegarLoop]: === Iteration 65 === [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-10-11 15:19:20,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:20,420 INFO L82 PathProgramCache]: Analyzing trace with hash -639652920, now seen corresponding path program 2 times [2020-10-11 15:19:20,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:20,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427622619] [2020-10-11 15:19:20,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:19:20,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427622619] [2020-10-11 15:19:20,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:20,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:19:20,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078898440] [2020-10-11 15:19:20,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:19:20,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:20,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:19:20,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:19:20,453 INFO L87 Difference]: Start difference. First operand 40208 states and 214272 transitions. Second operand 7 states. [2020-10-11 15:19:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:21,124 INFO L93 Difference]: Finished difference Result 90501 states and 440366 transitions. [2020-10-11 15:19:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:19:21,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-11 15:19:21,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:21,417 INFO L225 Difference]: With dead ends: 90501 [2020-10-11 15:19:21,417 INFO L226 Difference]: Without dead ends: 90424 [2020-10-11 15:19:21,417 INFO L673 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-10-11 15:19:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90424 states. [2020-10-11 15:19:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90424 to 40817. [2020-10-11 15:19:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40817 states. [2020-10-11 15:19:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40817 states to 40817 states and 217501 transitions. [2020-10-11 15:19:23,596 INFO L78 Accepts]: Start accepts. Automaton has 40817 states and 217501 transitions. Word has length 27 [2020-10-11 15:19:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:23,596 INFO L481 AbstractCegarLoop]: Abstraction has 40817 states and 217501 transitions. [2020-10-11 15:19:23,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:19:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand 40817 states and 217501 transitions. [2020-10-11 15:19:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:23,601 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:23,602 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:23,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2020-10-11 15:19:23,602 INFO L429 AbstractCegarLoop]: === Iteration 66 === [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-10-11 15:19:23,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:23,602 INFO L82 PathProgramCache]: Analyzing trace with hash -639668389, now seen corresponding path program 2 times [2020-10-11 15:19:23,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:23,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733467709] [2020-10-11 15:19:23,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:19:23,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733467709] [2020-10-11 15:19:23,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:23,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:19:23,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809597877] [2020-10-11 15:19:23,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:19:23,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:23,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:19:23,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:19:23,642 INFO L87 Difference]: Start difference. First operand 40817 states and 217501 transitions. Second operand 7 states. [2020-10-11 15:19:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:24,737 INFO L93 Difference]: Finished difference Result 91389 states and 444541 transitions. [2020-10-11 15:19:24,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:19:24,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-11 15:19:24,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:25,032 INFO L225 Difference]: With dead ends: 91389 [2020-10-11 15:19:25,033 INFO L226 Difference]: Without dead ends: 91312 [2020-10-11 15:19:25,033 INFO L673 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-10-11 15:19:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91312 states. [2020-10-11 15:19:27,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91312 to 41653. [2020-10-11 15:19:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41653 states. [2020-10-11 15:19:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41653 states to 41653 states and 221647 transitions. [2020-10-11 15:19:27,253 INFO L78 Accepts]: Start accepts. Automaton has 41653 states and 221647 transitions. Word has length 27 [2020-10-11 15:19:27,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:27,253 INFO L481 AbstractCegarLoop]: Abstraction has 41653 states and 221647 transitions. [2020-10-11 15:19:27,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:19:27,254 INFO L276 IsEmpty]: Start isEmpty. Operand 41653 states and 221647 transitions. [2020-10-11 15:19:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:27,258 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:27,258 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:27,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2020-10-11 15:19:27,259 INFO L429 AbstractCegarLoop]: === Iteration 67 === [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-10-11 15:19:27,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:27,259 INFO L82 PathProgramCache]: Analyzing trace with hash -639630848, now seen corresponding path program 1 times [2020-10-11 15:19:27,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:27,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898234441] [2020-10-11 15:19:27,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:19:27,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898234441] [2020-10-11 15:19:27,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:27,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:19:27,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187947264] [2020-10-11 15:19:27,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:19:27,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:27,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:19:27,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:19:27,292 INFO L87 Difference]: Start difference. First operand 41653 states and 221647 transitions. Second operand 7 states. [2020-10-11 15:19:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:28,029 INFO L93 Difference]: Finished difference Result 96066 states and 468402 transitions. [2020-10-11 15:19:28,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:19:28,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-11 15:19:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:28,343 INFO L225 Difference]: With dead ends: 96066 [2020-10-11 15:19:28,343 INFO L226 Difference]: Without dead ends: 95989 [2020-10-11 15:19:28,343 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:19:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95989 states. [2020-10-11 15:19:30,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95989 to 44034. [2020-10-11 15:19:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44034 states. [2020-10-11 15:19:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44034 states to 44034 states and 234037 transitions. [2020-10-11 15:19:30,616 INFO L78 Accepts]: Start accepts. Automaton has 44034 states and 234037 transitions. Word has length 27 [2020-10-11 15:19:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:30,617 INFO L481 AbstractCegarLoop]: Abstraction has 44034 states and 234037 transitions. [2020-10-11 15:19:30,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:19:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 44034 states and 234037 transitions. [2020-10-11 15:19:30,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:30,621 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:30,621 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:30,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2020-10-11 15:19:30,622 INFO L429 AbstractCegarLoop]: === Iteration 68 === [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-10-11 15:19:30,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:30,622 INFO L82 PathProgramCache]: Analyzing trace with hash -616120448, now seen corresponding path program 2 times [2020-10-11 15:19:30,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:30,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326555723] [2020-10-11 15:19:30,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:19:30,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326555723] [2020-10-11 15:19:30,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:30,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:19:30,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137293437] [2020-10-11 15:19:30,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:19:30,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:30,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:19:30,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:19:30,656 INFO L87 Difference]: Start difference. First operand 44034 states and 234037 transitions. Second operand 7 states. [2020-10-11 15:19:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:31,362 INFO L93 Difference]: Finished difference Result 97335 states and 474289 transitions. [2020-10-11 15:19:31,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:19:31,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-11 15:19:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:31,669 INFO L225 Difference]: With dead ends: 97335 [2020-10-11 15:19:31,669 INFO L226 Difference]: Without dead ends: 97258 [2020-10-11 15:19:31,670 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:19:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97258 states. [2020-10-11 15:19:34,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97258 to 45832. [2020-10-11 15:19:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45832 states. [2020-10-11 15:19:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45832 states to 45832 states and 243883 transitions. [2020-10-11 15:19:34,574 INFO L78 Accepts]: Start accepts. Automaton has 45832 states and 243883 transitions. Word has length 27 [2020-10-11 15:19:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:34,574 INFO L481 AbstractCegarLoop]: Abstraction has 45832 states and 243883 transitions. [2020-10-11 15:19:34,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:19:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 45832 states and 243883 transitions. [2020-10-11 15:19:34,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:34,580 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:34,580 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:34,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2020-10-11 15:19:34,580 INFO L429 AbstractCegarLoop]: === Iteration 69 === [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-10-11 15:19:34,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash -263020797, now seen corresponding path program 19 times [2020-10-11 15:19:34,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:34,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058442268] [2020-10-11 15:19:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:34,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:19:34,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058442268] [2020-10-11 15:19:34,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:34,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:19:34,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428119223] [2020-10-11 15:19:34,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:19:34,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:34,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:19:34,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:19:34,645 INFO L87 Difference]: Start difference. First operand 45832 states and 243883 transitions. Second operand 11 states. [2020-10-11 15:19:37,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:37,219 INFO L93 Difference]: Finished difference Result 206462 states and 913897 transitions. [2020-10-11 15:19:37,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:19:37,219 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:19:37,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:37,815 INFO L225 Difference]: With dead ends: 206462 [2020-10-11 15:19:37,815 INFO L226 Difference]: Without dead ends: 206438 [2020-10-11 15:19:37,815 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:19:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206438 states. [2020-10-11 15:19:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206438 to 45730. [2020-10-11 15:19:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45730 states. [2020-10-11 15:19:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45730 states to 45730 states and 243333 transitions. [2020-10-11 15:19:43,137 INFO L78 Accepts]: Start accepts. Automaton has 45730 states and 243333 transitions. Word has length 27 [2020-10-11 15:19:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:43,138 INFO L481 AbstractCegarLoop]: Abstraction has 45730 states and 243333 transitions. [2020-10-11 15:19:43,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:19:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 45730 states and 243333 transitions. [2020-10-11 15:19:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:43,143 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:43,143 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:43,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2020-10-11 15:19:43,143 INFO L429 AbstractCegarLoop]: === Iteration 70 === [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-10-11 15:19:43,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:43,144 INFO L82 PathProgramCache]: Analyzing trace with hash -277871037, now seen corresponding path program 20 times [2020-10-11 15:19:43,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:43,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788824353] [2020-10-11 15:19:43,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:19:43,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788824353] [2020-10-11 15:19:43,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:43,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:19:43,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167007252] [2020-10-11 15:19:43,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:19:43,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:43,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:19:43,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:19:43,216 INFO L87 Difference]: Start difference. First operand 45730 states and 243333 transitions. Second operand 11 states. [2020-10-11 15:19:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:45,751 INFO L93 Difference]: Finished difference Result 205970 states and 911791 transitions. [2020-10-11 15:19:45,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:19:45,752 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:19:45,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:46,346 INFO L225 Difference]: With dead ends: 205970 [2020-10-11 15:19:46,346 INFO L226 Difference]: Without dead ends: 205940 [2020-10-11 15:19:46,347 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1548 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:19:48,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205940 states. [2020-10-11 15:19:50,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205940 to 45335. [2020-10-11 15:19:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45335 states. [2020-10-11 15:19:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45335 states to 45335 states and 241261 transitions. [2020-10-11 15:19:51,875 INFO L78 Accepts]: Start accepts. Automaton has 45335 states and 241261 transitions. Word has length 27 [2020-10-11 15:19:51,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:51,876 INFO L481 AbstractCegarLoop]: Abstraction has 45335 states and 241261 transitions. [2020-10-11 15:19:51,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:19:51,876 INFO L276 IsEmpty]: Start isEmpty. Operand 45335 states and 241261 transitions. [2020-10-11 15:19:51,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:51,882 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:51,882 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:51,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2020-10-11 15:19:51,882 INFO L429 AbstractCegarLoop]: === Iteration 71 === [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-10-11 15:19:51,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:51,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1023950403, now seen corresponding path program 21 times [2020-10-11 15:19:51,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:51,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970678561] [2020-10-11 15:19:51,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:19:51,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970678561] [2020-10-11 15:19:51,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:51,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:19:51,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540652715] [2020-10-11 15:19:51,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:19:51,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:51,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:19:51,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:19:51,950 INFO L87 Difference]: Start difference. First operand 45335 states and 241261 transitions. Second operand 11 states. [2020-10-11 15:19:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:54,596 INFO L93 Difference]: Finished difference Result 205404 states and 909139 transitions. [2020-10-11 15:19:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:19:54,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:19:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:55,198 INFO L225 Difference]: With dead ends: 205404 [2020-10-11 15:19:55,198 INFO L226 Difference]: Without dead ends: 205380 [2020-10-11 15:19:55,198 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1547 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:19:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205380 states. [2020-10-11 15:19:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205380 to 45076. [2020-10-11 15:19:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45076 states. [2020-10-11 15:19:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45076 states to 45076 states and 240064 transitions. [2020-10-11 15:19:59,484 INFO L78 Accepts]: Start accepts. Automaton has 45076 states and 240064 transitions. Word has length 27 [2020-10-11 15:19:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:59,484 INFO L481 AbstractCegarLoop]: Abstraction has 45076 states and 240064 transitions. [2020-10-11 15:19:59,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:19:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 45076 states and 240064 transitions. [2020-10-11 15:19:59,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:59,490 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:59,490 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:59,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2020-10-11 15:19:59,490 INFO L429 AbstractCegarLoop]: === Iteration 72 === [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-10-11 15:19:59,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:59,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1010439363, now seen corresponding path program 22 times [2020-10-11 15:19:59,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:59,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601558705] [2020-10-11 15:19:59,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:19:59,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601558705] [2020-10-11 15:19:59,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:59,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:19:59,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307638696] [2020-10-11 15:19:59,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:19:59,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:59,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:19:59,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:19:59,559 INFO L87 Difference]: Start difference. First operand 45076 states and 240064 transitions. Second operand 11 states. [2020-10-11 15:20:02,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:02,593 INFO L93 Difference]: Finished difference Result 205143 states and 907975 transitions. [2020-10-11 15:20:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:20:02,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:20:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:03,178 INFO L225 Difference]: With dead ends: 205143 [2020-10-11 15:20:03,178 INFO L226 Difference]: Without dead ends: 205113 [2020-10-11 15:20:03,179 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1562 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:20:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205113 states. [2020-10-11 15:20:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205113 to 44685. [2020-10-11 15:20:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44685 states. [2020-10-11 15:20:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44685 states to 44685 states and 238000 transitions. [2020-10-11 15:20:07,396 INFO L78 Accepts]: Start accepts. Automaton has 44685 states and 238000 transitions. Word has length 27 [2020-10-11 15:20:07,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:07,397 INFO L481 AbstractCegarLoop]: Abstraction has 44685 states and 238000 transitions. [2020-10-11 15:20:07,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:07,397 INFO L276 IsEmpty]: Start isEmpty. Operand 44685 states and 238000 transitions. [2020-10-11 15:20:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:20:07,402 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:07,402 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:07,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2020-10-11 15:20:07,402 INFO L429 AbstractCegarLoop]: === Iteration 73 === [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-10-11 15:20:07,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:07,402 INFO L82 PathProgramCache]: Analyzing trace with hash -377078589, now seen corresponding path program 23 times [2020-10-11 15:20:07,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:07,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737790529] [2020-10-11 15:20:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:20:07,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737790529] [2020-10-11 15:20:07,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:20:07,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:20:07,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751580586] [2020-10-11 15:20:07,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:07,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:07,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:07,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:07,475 INFO L87 Difference]: Start difference. First operand 44685 states and 238000 transitions. Second operand 11 states. [2020-10-11 15:20:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:10,732 INFO L93 Difference]: Finished difference Result 204573 states and 905311 transitions. [2020-10-11 15:20:10,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:20:10,732 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:20:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:11,372 INFO L225 Difference]: With dead ends: 204573 [2020-10-11 15:20:11,372 INFO L226 Difference]: Without dead ends: 204549 [2020-10-11 15:20:11,373 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1554 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:20:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204549 states. [2020-10-11 15:20:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204549 to 44434. [2020-10-11 15:20:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44434 states. [2020-10-11 15:20:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44434 states to 44434 states and 236823 transitions. [2020-10-11 15:20:15,528 INFO L78 Accepts]: Start accepts. Automaton has 44434 states and 236823 transitions. Word has length 27 [2020-10-11 15:20:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:15,528 INFO L481 AbstractCegarLoop]: Abstraction has 44434 states and 236823 transitions. [2020-10-11 15:20:15,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 44434 states and 236823 transitions. [2020-10-11 15:20:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:20:15,534 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:15,534 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:15,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2020-10-11 15:20:15,534 INFO L429 AbstractCegarLoop]: === Iteration 74 === [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-10-11 15:20:15,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:15,534 INFO L82 PathProgramCache]: Analyzing trace with hash -375739389, now seen corresponding path program 24 times [2020-10-11 15:20:15,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:15,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990909199] [2020-10-11 15:20:15,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:20:15,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990909199] [2020-10-11 15:20:15,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:20:15,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:20:15,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198156035] [2020-10-11 15:20:15,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:15,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:15,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:15,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:15,610 INFO L87 Difference]: Start difference. First operand 44434 states and 236823 transitions. Second operand 11 states. [2020-10-11 15:20:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:18,375 INFO L93 Difference]: Finished difference Result 204089 states and 903225 transitions. [2020-10-11 15:20:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:20:18,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:20:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:19,924 INFO L225 Difference]: With dead ends: 204089 [2020-10-11 15:20:19,924 INFO L226 Difference]: Without dead ends: 204054 [2020-10-11 15:20:19,924 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:20:21,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204054 states. [2020-10-11 15:20:23,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204054 to 43794. [2020-10-11 15:20:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43794 states. [2020-10-11 15:20:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43794 states to 43794 states and 233791 transitions. [2020-10-11 15:20:23,925 INFO L78 Accepts]: Start accepts. Automaton has 43794 states and 233791 transitions. Word has length 27 [2020-10-11 15:20:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:23,926 INFO L481 AbstractCegarLoop]: Abstraction has 43794 states and 233791 transitions. [2020-10-11 15:20:23,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 43794 states and 233791 transitions. [2020-10-11 15:20:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:20:23,934 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:23,934 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:23,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2020-10-11 15:20:23,934 INFO L429 AbstractCegarLoop]: === Iteration 75 === [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-10-11 15:20:23,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:23,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1079064756, now seen corresponding path program 1 times [2020-10-11 15:20:23,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:23,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514593645] [2020-10-11 15:20:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:23,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514593645] [2020-10-11 15:20:23,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723245718] [2020-10-11 15:20:23,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:24,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:20:24,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:20:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:24,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:20:24,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:20:24,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568899260] [2020-10-11 15:20:24,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:24,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:24,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:24,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:24,102 INFO L87 Difference]: Start difference. First operand 43794 states and 233791 transitions. Second operand 11 states. [2020-10-11 15:20:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:25,503 INFO L93 Difference]: Finished difference Result 139868 states and 649854 transitions. [2020-10-11 15:20:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:20:25,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:20:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:25,918 INFO L225 Difference]: With dead ends: 139868 [2020-10-11 15:20:25,918 INFO L226 Difference]: Without dead ends: 139824 [2020-10-11 15:20:25,918 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 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-10-11 15:20:27,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139824 states. [2020-10-11 15:20:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139824 to 44208. [2020-10-11 15:20:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2020-10-11 15:20:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 235737 transitions. [2020-10-11 15:20:29,766 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 235737 transitions. Word has length 29 [2020-10-11 15:20:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:29,766 INFO L481 AbstractCegarLoop]: Abstraction has 44208 states and 235737 transitions. [2020-10-11 15:20:29,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 235737 transitions. [2020-10-11 15:20:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:20:29,775 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:29,775 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:29,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable149 [2020-10-11 15:20:29,976 INFO L429 AbstractCegarLoop]: === Iteration 76 === [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-10-11 15:20:29,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:29,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1079080225, now seen corresponding path program 1 times [2020-10-11 15:20:29,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:29,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064858979] [2020-10-11 15:20:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:30,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064858979] [2020-10-11 15:20:30,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140522805] [2020-10-11 15:20:30,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:30,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:20:30,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:20:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:30,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:20:30,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:20:30,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083598858] [2020-10-11 15:20:30,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:30,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:30,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:30,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:30,137 INFO L87 Difference]: Start difference. First operand 44208 states and 235737 transitions. Second operand 11 states. [2020-10-11 15:20:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:31,609 INFO L93 Difference]: Finished difference Result 138663 states and 644549 transitions. [2020-10-11 15:20:31,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:20:31,609 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:20:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:32,018 INFO L225 Difference]: With dead ends: 138663 [2020-10-11 15:20:32,018 INFO L226 Difference]: Without dead ends: 138619 [2020-10-11 15:20:32,018 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 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-10-11 15:20:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138619 states. [2020-10-11 15:20:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138619 to 44346. [2020-10-11 15:20:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44346 states. [2020-10-11 15:20:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44346 states to 44346 states and 236212 transitions. [2020-10-11 15:20:35,131 INFO L78 Accepts]: Start accepts. Automaton has 44346 states and 236212 transitions. Word has length 29 [2020-10-11 15:20:35,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:35,132 INFO L481 AbstractCegarLoop]: Abstraction has 44346 states and 236212 transitions. [2020-10-11 15:20:35,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 44346 states and 236212 transitions. [2020-10-11 15:20:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:20:35,140 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:35,140 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:35,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150,62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:35,341 INFO L429 AbstractCegarLoop]: === Iteration 77 === [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-10-11 15:20:35,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:35,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1079042684, now seen corresponding path program 1 times [2020-10-11 15:20:35,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:35,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768107704] [2020-10-11 15:20:35,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:35,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768107704] [2020-10-11 15:20:35,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251990790] [2020-10-11 15:20:35,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:35,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:20:35,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:20:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:36,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:20:36,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:20:36,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98861210] [2020-10-11 15:20:36,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:36,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:36,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:36,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:36,179 INFO L87 Difference]: Start difference. First operand 44346 states and 236212 transitions. Second operand 11 states. [2020-10-11 15:20:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:37,547 INFO L93 Difference]: Finished difference Result 137475 states and 638613 transitions. [2020-10-11 15:20:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:20:37,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:20:37,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:37,958 INFO L225 Difference]: With dead ends: 137475 [2020-10-11 15:20:37,958 INFO L226 Difference]: Without dead ends: 137431 [2020-10-11 15:20:37,958 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:20:39,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137431 states. [2020-10-11 15:20:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137431 to 44001. [2020-10-11 15:20:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44001 states. [2020-10-11 15:20:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44001 states to 44001 states and 234197 transitions. [2020-10-11 15:20:40,975 INFO L78 Accepts]: Start accepts. Automaton has 44001 states and 234197 transitions. Word has length 29 [2020-10-11 15:20:40,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:40,975 INFO L481 AbstractCegarLoop]: Abstraction has 44001 states and 234197 transitions. [2020-10-11 15:20:40,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:40,975 INFO L276 IsEmpty]: Start isEmpty. Operand 44001 states and 234197 transitions. [2020-10-11 15:20:40,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:20:40,984 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:40,984 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:41,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:41,185 INFO L429 AbstractCegarLoop]: === Iteration 78 === [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-10-11 15:20:41,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:41,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1076743476, now seen corresponding path program 2 times [2020-10-11 15:20:41,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:41,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193436054] [2020-10-11 15:20:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:41,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193436054] [2020-10-11 15:20:41,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595855904] [2020-10-11 15:20:41,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:41,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:20:41,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:20:41,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:20:41,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:20:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:41,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:20:41,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:20:41,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573234219] [2020-10-11 15:20:41,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:41,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:41,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:41,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:41,346 INFO L87 Difference]: Start difference. First operand 44001 states and 234197 transitions. Second operand 11 states. [2020-10-11 15:20:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:42,784 INFO L93 Difference]: Finished difference Result 137660 states and 639047 transitions. [2020-10-11 15:20:42,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:20:42,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:20:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:43,182 INFO L225 Difference]: With dead ends: 137660 [2020-10-11 15:20:43,182 INFO L226 Difference]: Without dead ends: 137614 [2020-10-11 15:20:43,183 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 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-10-11 15:20:44,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137614 states. [2020-10-11 15:20:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137614 to 43606. [2020-10-11 15:20:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43606 states. [2020-10-11 15:20:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43606 states to 43606 states and 231805 transitions. [2020-10-11 15:20:46,988 INFO L78 Accepts]: Start accepts. Automaton has 43606 states and 231805 transitions. Word has length 29 [2020-10-11 15:20:46,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:46,989 INFO L481 AbstractCegarLoop]: Abstraction has 43606 states and 231805 transitions. [2020-10-11 15:20:46,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:46,989 INFO L276 IsEmpty]: Start isEmpty. Operand 43606 states and 231805 transitions. [2020-10-11 15:20:46,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:20:46,998 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:46,998 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:47,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152,64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:47,199 INFO L429 AbstractCegarLoop]: === Iteration 79 === [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-10-11 15:20:47,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:47,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1091609185, now seen corresponding path program 2 times [2020-10-11 15:20:47,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:47,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146718994] [2020-10-11 15:20:47,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:47,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146718994] [2020-10-11 15:20:47,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789543627] [2020-10-11 15:20:47,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:47,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:20:47,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:20:47,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:20:47,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:20:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:47,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:20:47,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:20:47,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633908167] [2020-10-11 15:20:47,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:47,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:47,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:47,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:47,358 INFO L87 Difference]: Start difference. First operand 43606 states and 231805 transitions. Second operand 11 states. [2020-10-11 15:20:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:48,718 INFO L93 Difference]: Finished difference Result 136227 states and 631974 transitions. [2020-10-11 15:20:48,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:20:48,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:20:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:49,118 INFO L225 Difference]: With dead ends: 136227 [2020-10-11 15:20:49,118 INFO L226 Difference]: Without dead ends: 136181 [2020-10-11 15:20:49,119 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:20:50,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136181 states. [2020-10-11 15:20:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136181 to 43334. [2020-10-11 15:20:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43334 states. [2020-10-11 15:20:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43334 states to 43334 states and 230138 transitions. [2020-10-11 15:20:52,097 INFO L78 Accepts]: Start accepts. Automaton has 43334 states and 230138 transitions. Word has length 29 [2020-10-11 15:20:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:52,097 INFO L481 AbstractCegarLoop]: Abstraction has 43334 states and 230138 transitions. [2020-10-11 15:20:52,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand 43334 states and 230138 transitions. [2020-10-11 15:20:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:20:52,105 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:52,105 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:52,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153,65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:52,313 INFO L429 AbstractCegarLoop]: === Iteration 80 === [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-10-11 15:20:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:52,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1055532284, now seen corresponding path program 2 times [2020-10-11 15:20:52,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:52,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164011607] [2020-10-11 15:20:52,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:52,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164011607] [2020-10-11 15:20:52,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742890601] [2020-10-11 15:20:52,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:52,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:20:52,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:20:52,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:20:52,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:20:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:52,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:20:52,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:20:52,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651861812] [2020-10-11 15:20:52,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:52,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:52,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:52,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:52,473 INFO L87 Difference]: Start difference. First operand 43334 states and 230138 transitions. Second operand 11 states. [2020-10-11 15:20:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:54,307 INFO L93 Difference]: Finished difference Result 135193 states and 626279 transitions. [2020-10-11 15:20:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:20:54,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:20:54,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:54,704 INFO L225 Difference]: With dead ends: 135193 [2020-10-11 15:20:54,704 INFO L226 Difference]: Without dead ends: 135147 [2020-10-11 15:20:54,704 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:20:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135147 states. [2020-10-11 15:20:57,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135147 to 43128. [2020-10-11 15:20:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43128 states. [2020-10-11 15:20:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43128 states to 43128 states and 228903 transitions. [2020-10-11 15:20:57,626 INFO L78 Accepts]: Start accepts. Automaton has 43128 states and 228903 transitions. Word has length 29 [2020-10-11 15:20:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:57,626 INFO L481 AbstractCegarLoop]: Abstraction has 43128 states and 228903 transitions. [2020-10-11 15:20:57,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand 43128 states and 228903 transitions. [2020-10-11 15:20:57,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:20:57,634 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:57,634 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:57,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable154 [2020-10-11 15:20:57,835 INFO L429 AbstractCegarLoop]: === Iteration 81 === [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-10-11 15:20:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:57,835 INFO L82 PathProgramCache]: Analyzing trace with hash -233799798, now seen corresponding path program 3 times [2020-10-11 15:20:57,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:57,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816352693] [2020-10-11 15:20:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:20:57,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816352693] [2020-10-11 15:20:57,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520884983] [2020-10-11 15:20:57,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:57,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-11 15:20:57,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:20:57,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:20:57,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:20:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:20:58,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:20:58,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:20:58,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104725212] [2020-10-11 15:20:58,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:58,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:58,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:58,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:58,005 INFO L87 Difference]: Start difference. First operand 43128 states and 228903 transitions. Second operand 11 states. [2020-10-11 15:20:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:59,420 INFO L93 Difference]: Finished difference Result 135315 states and 626661 transitions. [2020-10-11 15:20:59,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:20:59,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:20:59,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:59,796 INFO L225 Difference]: With dead ends: 135315 [2020-10-11 15:20:59,796 INFO L226 Difference]: Without dead ends: 135271 [2020-10-11 15:20:59,797 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 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-10-11 15:21:01,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135271 states. [2020-10-11 15:21:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135271 to 42904. [2020-10-11 15:21:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42904 states. [2020-10-11 15:21:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42904 states to 42904 states and 227530 transitions. [2020-10-11 15:21:03,527 INFO L78 Accepts]: Start accepts. Automaton has 42904 states and 227530 transitions. Word has length 29 [2020-10-11 15:21:03,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:03,528 INFO L481 AbstractCegarLoop]: Abstraction has 42904 states and 227530 transitions. [2020-10-11 15:21:03,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 42904 states and 227530 transitions. [2020-10-11 15:21:03,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:03,535 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:03,536 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:03,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable155 [2020-10-11 15:21:03,736 INFO L429 AbstractCegarLoop]: === Iteration 82 === [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-10-11 15:21:03,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:03,737 INFO L82 PathProgramCache]: Analyzing trace with hash -938803546, now seen corresponding path program 1 times [2020-10-11 15:21:03,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:03,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379451637] [2020-10-11 15:21:03,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:21:03,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379451637] [2020-10-11 15:21:03,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396942728] [2020-10-11 15:21:03,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:03,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:03,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:21:03,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:03,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:03,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191958163] [2020-10-11 15:21:03,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:03,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:03,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:03,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:03,897 INFO L87 Difference]: Start difference. First operand 42904 states and 227530 transitions. Second operand 11 states. [2020-10-11 15:21:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:05,332 INFO L93 Difference]: Finished difference Result 140989 states and 654549 transitions. [2020-10-11 15:21:05,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:05,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:05,766 INFO L225 Difference]: With dead ends: 140989 [2020-10-11 15:21:05,766 INFO L226 Difference]: Without dead ends: 140945 [2020-10-11 15:21:05,766 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140945 states. [2020-10-11 15:21:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140945 to 42930. [2020-10-11 15:21:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42930 states. [2020-10-11 15:21:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42930 states to 42930 states and 227280 transitions. [2020-10-11 15:21:08,844 INFO L78 Accepts]: Start accepts. Automaton has 42930 states and 227280 transitions. Word has length 29 [2020-10-11 15:21:08,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:08,845 INFO L481 AbstractCegarLoop]: Abstraction has 42930 states and 227280 transitions. [2020-10-11 15:21:08,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 42930 states and 227280 transitions. [2020-10-11 15:21:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:08,853 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:08,853 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:09,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156,68 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:09,054 INFO L429 AbstractCegarLoop]: === Iteration 83 === [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-10-11 15:21:09,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:09,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1231154336, now seen corresponding path program 4 times [2020-10-11 15:21:09,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:09,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853044031] [2020-10-11 15:21:09,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:09,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853044031] [2020-10-11 15:21:09,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12823934] [2020-10-11 15:21:09,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:09,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:21:09,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:09,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:09,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:09,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:09,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:09,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167352563] [2020-10-11 15:21:09,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:09,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:09,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:09,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:09,217 INFO L87 Difference]: Start difference. First operand 42930 states and 227280 transitions. Second operand 11 states. [2020-10-11 15:21:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:10,619 INFO L93 Difference]: Finished difference Result 136674 states and 632799 transitions. [2020-10-11 15:21:10,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:10,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:10,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:11,003 INFO L225 Difference]: With dead ends: 136674 [2020-10-11 15:21:11,003 INFO L226 Difference]: Without dead ends: 136628 [2020-10-11 15:21:11,003 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 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-10-11 15:21:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136628 states. [2020-10-11 15:21:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136628 to 43133. [2020-10-11 15:21:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43133 states. [2020-10-11 15:21:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43133 states to 43133 states and 228222 transitions. [2020-10-11 15:21:14,621 INFO L78 Accepts]: Start accepts. Automaton has 43133 states and 228222 transitions. Word has length 29 [2020-10-11 15:21:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:14,622 INFO L481 AbstractCegarLoop]: Abstraction has 43133 states and 228222 transitions. [2020-10-11 15:21:14,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 43133 states and 228222 transitions. [2020-10-11 15:21:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:14,630 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:14,631 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:14,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable157 [2020-10-11 15:21:14,831 INFO L429 AbstractCegarLoop]: === Iteration 84 === [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-10-11 15:21:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:14,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1231140262, now seen corresponding path program 2 times [2020-10-11 15:21:14,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:14,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215920052] [2020-10-11 15:21:14,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:14,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215920052] [2020-10-11 15:21:14,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421766880] [2020-10-11 15:21:14,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:14,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:21:14,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:14,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:14,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:14,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:14,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:14,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573227563] [2020-10-11 15:21:14,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:14,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:14,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:14,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:14,991 INFO L87 Difference]: Start difference. First operand 43133 states and 228222 transitions. Second operand 11 states. [2020-10-11 15:21:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:16,380 INFO L93 Difference]: Finished difference Result 137702 states and 638553 transitions. [2020-10-11 15:21:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:16,381 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:16,795 INFO L225 Difference]: With dead ends: 137702 [2020-10-11 15:21:16,795 INFO L226 Difference]: Without dead ends: 137652 [2020-10-11 15:21:16,795 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 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-10-11 15:21:18,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137652 states. [2020-10-11 15:21:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137652 to 42970. [2020-10-11 15:21:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42970 states. [2020-10-11 15:21:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42970 states to 42970 states and 227334 transitions. [2020-10-11 15:21:19,868 INFO L78 Accepts]: Start accepts. Automaton has 42970 states and 227334 transitions. Word has length 29 [2020-10-11 15:21:19,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:19,868 INFO L481 AbstractCegarLoop]: Abstraction has 42970 states and 227334 transitions. [2020-10-11 15:21:19,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 42970 states and 227334 transitions. [2020-10-11 15:21:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:19,876 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:19,876 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:20,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable158 [2020-10-11 15:21:20,077 INFO L429 AbstractCegarLoop]: === Iteration 85 === [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-10-11 15:21:20,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1231177803, now seen corresponding path program 1 times [2020-10-11 15:21:20,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:20,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298158824] [2020-10-11 15:21:20,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:20,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298158824] [2020-10-11 15:21:20,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832157182] [2020-10-11 15:21:20,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:20,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:20,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:20,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:20,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:20,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585264282] [2020-10-11 15:21:20,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:20,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:20,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:20,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:20,233 INFO L87 Difference]: Start difference. First operand 42970 states and 227334 transitions. Second operand 11 states. [2020-10-11 15:21:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:21,889 INFO L93 Difference]: Finished difference Result 136895 states and 634251 transitions. [2020-10-11 15:21:21,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:21,890 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:21,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:22,283 INFO L225 Difference]: With dead ends: 136895 [2020-10-11 15:21:22,283 INFO L226 Difference]: Without dead ends: 136851 [2020-10-11 15:21:22,283 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136851 states. [2020-10-11 15:21:25,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136851 to 42730. [2020-10-11 15:21:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42730 states. [2020-10-11 15:21:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42730 states to 42730 states and 225896 transitions. [2020-10-11 15:21:25,370 INFO L78 Accepts]: Start accepts. Automaton has 42730 states and 225896 transitions. Word has length 29 [2020-10-11 15:21:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:25,370 INFO L481 AbstractCegarLoop]: Abstraction has 42730 states and 225896 transitions. [2020-10-11 15:21:25,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:25,370 INFO L276 IsEmpty]: Start isEmpty. Operand 42730 states and 225896 transitions. [2020-10-11 15:21:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:25,378 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:25,379 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:25,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable159 [2020-10-11 15:21:25,584 INFO L429 AbstractCegarLoop]: === Iteration 86 === [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-10-11 15:21:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:25,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1254688203, now seen corresponding path program 2 times [2020-10-11 15:21:25,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:25,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80212752] [2020-10-11 15:21:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:25,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80212752] [2020-10-11 15:21:25,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362194732] [2020-10-11 15:21:25,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:25,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:21:25,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:25,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:25,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:25,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:25,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:25,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585943150] [2020-10-11 15:21:25,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:25,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:25,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:25,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:25,739 INFO L87 Difference]: Start difference. First operand 42730 states and 225896 transitions. Second operand 11 states. [2020-10-11 15:21:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:27,115 INFO L93 Difference]: Finished difference Result 136603 states and 632426 transitions. [2020-10-11 15:21:27,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:27,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:27,528 INFO L225 Difference]: With dead ends: 136603 [2020-10-11 15:21:27,528 INFO L226 Difference]: Without dead ends: 136553 [2020-10-11 15:21:27,528 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:28,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136553 states. [2020-10-11 15:21:31,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136553 to 42336. [2020-10-11 15:21:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42336 states. [2020-10-11 15:21:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42336 states to 42336 states and 223735 transitions. [2020-10-11 15:21:31,185 INFO L78 Accepts]: Start accepts. Automaton has 42336 states and 223735 transitions. Word has length 29 [2020-10-11 15:21:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:31,185 INFO L481 AbstractCegarLoop]: Abstraction has 42336 states and 223735 transitions. [2020-10-11 15:21:31,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 42336 states and 223735 transitions. [2020-10-11 15:21:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:31,193 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:31,193 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:31,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160,72 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:31,394 INFO L429 AbstractCegarLoop]: === Iteration 87 === [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-10-11 15:21:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1636984727, now seen corresponding path program 3 times [2020-10-11 15:21:31,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:31,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685503008] [2020-10-11 15:21:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:31,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685503008] [2020-10-11 15:21:31,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495712006] [2020-10-11 15:21:31,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:31,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:21:31,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:31,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:31,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:31,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:31,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:31,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997267568] [2020-10-11 15:21:31,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:31,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:31,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:31,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:31,553 INFO L87 Difference]: Start difference. First operand 42336 states and 223735 transitions. Second operand 11 states. [2020-10-11 15:21:32,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:32,909 INFO L93 Difference]: Finished difference Result 136165 states and 630523 transitions. [2020-10-11 15:21:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:32,910 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:32,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:33,307 INFO L225 Difference]: With dead ends: 136165 [2020-10-11 15:21:33,308 INFO L226 Difference]: Without dead ends: 136121 [2020-10-11 15:21:33,308 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 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-10-11 15:21:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136121 states. [2020-10-11 15:21:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136121 to 42190. [2020-10-11 15:21:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42190 states. [2020-10-11 15:21:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42190 states to 42190 states and 222836 transitions. [2020-10-11 15:21:36,287 INFO L78 Accepts]: Start accepts. Automaton has 42190 states and 222836 transitions. Word has length 29 [2020-10-11 15:21:36,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:36,287 INFO L481 AbstractCegarLoop]: Abstraction has 42190 states and 222836 transitions. [2020-10-11 15:21:36,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand 42190 states and 222836 transitions. [2020-10-11 15:21:36,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:36,295 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:36,295 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:36,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161,73 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:36,496 INFO L429 AbstractCegarLoop]: === Iteration 88 === [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-10-11 15:21:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:36,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1194503706, now seen corresponding path program 3 times [2020-10-11 15:21:36,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:36,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081499324] [2020-10-11 15:21:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:36,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081499324] [2020-10-11 15:21:36,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110268452] [2020-10-11 15:21:36,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:36,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:21:36,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:36,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:36,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:36,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:36,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:36,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119912296] [2020-10-11 15:21:36,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:36,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:36,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:36,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:36,654 INFO L87 Difference]: Start difference. First operand 42190 states and 222836 transitions. Second operand 11 states. [2020-10-11 15:21:37,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:37,994 INFO L93 Difference]: Finished difference Result 135620 states and 627622 transitions. [2020-10-11 15:21:37,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:37,994 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:38,399 INFO L225 Difference]: With dead ends: 135620 [2020-10-11 15:21:38,399 INFO L226 Difference]: Without dead ends: 135576 [2020-10-11 15:21:38,399 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135576 states. [2020-10-11 15:21:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135576 to 42095. [2020-10-11 15:21:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42095 states. [2020-10-11 15:21:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42095 states to 42095 states and 222269 transitions. [2020-10-11 15:21:41,969 INFO L78 Accepts]: Start accepts. Automaton has 42095 states and 222269 transitions. Word has length 29 [2020-10-11 15:21:41,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:41,969 INFO L481 AbstractCegarLoop]: Abstraction has 42095 states and 222269 transitions. [2020-10-11 15:21:41,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 42095 states and 222269 transitions. [2020-10-11 15:21:41,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:41,977 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:41,978 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:42,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:42,178 INFO L429 AbstractCegarLoop]: === Iteration 89 === [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-10-11 15:21:42,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:42,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1497105939, now seen corresponding path program 4 times [2020-10-11 15:21:42,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:42,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058777175] [2020-10-11 15:21:42,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:42,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058777175] [2020-10-11 15:21:42,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258009495] [2020-10-11 15:21:42,230 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:42,318 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:21:42,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:42,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:42,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:42,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:42,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:42,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188680852] [2020-10-11 15:21:42,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:42,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:42,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:42,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:42,339 INFO L87 Difference]: Start difference. First operand 42095 states and 222269 transitions. Second operand 11 states. [2020-10-11 15:21:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:43,770 INFO L93 Difference]: Finished difference Result 137900 states and 638782 transitions. [2020-10-11 15:21:43,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:43,771 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:44,182 INFO L225 Difference]: With dead ends: 137900 [2020-10-11 15:21:44,182 INFO L226 Difference]: Without dead ends: 137850 [2020-10-11 15:21:44,182 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 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-10-11 15:21:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137850 states. [2020-10-11 15:21:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137850 to 42209. [2020-10-11 15:21:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42209 states. [2020-10-11 15:21:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42209 states to 42209 states and 222796 transitions. [2020-10-11 15:21:47,249 INFO L78 Accepts]: Start accepts. Automaton has 42209 states and 222796 transitions. Word has length 29 [2020-10-11 15:21:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:47,249 INFO L481 AbstractCegarLoop]: Abstraction has 42209 states and 222796 transitions. [2020-10-11 15:21:47,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 42209 states and 222796 transitions. [2020-10-11 15:21:47,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:47,257 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:47,258 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:47,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163,75 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:47,458 INFO L429 AbstractCegarLoop]: === Iteration 90 === [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-10-11 15:21:47,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:47,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1497107334, now seen corresponding path program 4 times [2020-10-11 15:21:47,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:47,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102480670] [2020-10-11 15:21:47,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:47,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102480670] [2020-10-11 15:21:47,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953708138] [2020-10-11 15:21:47,512 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:47,598 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:21:47,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:47,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:47,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:47,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:47,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:47,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483592016] [2020-10-11 15:21:47,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:47,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:47,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:47,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:47,620 INFO L87 Difference]: Start difference. First operand 42209 states and 222796 transitions. Second operand 11 states. [2020-10-11 15:21:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:49,529 INFO L93 Difference]: Finished difference Result 136803 states and 633722 transitions. [2020-10-11 15:21:49,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:49,530 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:49,947 INFO L225 Difference]: With dead ends: 136803 [2020-10-11 15:21:49,947 INFO L226 Difference]: Without dead ends: 136753 [2020-10-11 15:21:49,948 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 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-10-11 15:21:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136753 states. [2020-10-11 15:21:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136753 to 42058. [2020-10-11 15:21:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42058 states. [2020-10-11 15:21:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42058 states to 42058 states and 221940 transitions. [2020-10-11 15:21:52,985 INFO L78 Accepts]: Start accepts. Automaton has 42058 states and 221940 transitions. Word has length 29 [2020-10-11 15:21:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:52,986 INFO L481 AbstractCegarLoop]: Abstraction has 42058 states and 221940 transitions. [2020-10-11 15:21:52,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 42058 states and 221940 transitions. [2020-10-11 15:21:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:52,995 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:52,995 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:53,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164,76 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:53,196 INFO L429 AbstractCegarLoop]: === Iteration 91 === [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-10-11 15:21:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1497129406, now seen corresponding path program 1 times [2020-10-11 15:21:53,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:53,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726824857] [2020-10-11 15:21:53,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:53,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726824857] [2020-10-11 15:21:53,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405604815] [2020-10-11 15:21:53,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:53,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:53,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:53,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:53,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:53,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532967862] [2020-10-11 15:21:53,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:53,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:53,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:53,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:53,355 INFO L87 Difference]: Start difference. First operand 42058 states and 221940 transitions. Second operand 11 states. [2020-10-11 15:21:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:54,811 INFO L93 Difference]: Finished difference Result 136837 states and 634815 transitions. [2020-10-11 15:21:54,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:54,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:54,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:55,229 INFO L225 Difference]: With dead ends: 136837 [2020-10-11 15:21:55,230 INFO L226 Difference]: Without dead ends: 136793 [2020-10-11 15:21:55,230 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:56,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136793 states. [2020-10-11 15:21:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136793 to 41929. [2020-10-11 15:21:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41929 states. [2020-10-11 15:21:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41929 states to 41929 states and 221167 transitions. [2020-10-11 15:21:59,096 INFO L78 Accepts]: Start accepts. Automaton has 41929 states and 221167 transitions. Word has length 29 [2020-10-11 15:21:59,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:59,097 INFO L481 AbstractCegarLoop]: Abstraction has 41929 states and 221167 transitions. [2020-10-11 15:21:59,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 41929 states and 221167 transitions. [2020-10-11 15:21:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:59,105 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:59,105 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:59,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165,77 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:59,306 INFO L429 AbstractCegarLoop]: === Iteration 92 === [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-10-11 15:21:59,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:59,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1520639806, now seen corresponding path program 2 times [2020-10-11 15:21:59,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:59,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491493502] [2020-10-11 15:21:59,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:59,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491493502] [2020-10-11 15:21:59,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329774895] [2020-10-11 15:21:59,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:59,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:21:59,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:59,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:59,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:59,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:59,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:59,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89275002] [2020-10-11 15:21:59,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:59,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:59,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:59,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:59,464 INFO L87 Difference]: Start difference. First operand 41929 states and 221167 transitions. Second operand 11 states. [2020-10-11 15:22:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:00,821 INFO L93 Difference]: Finished difference Result 136136 states and 631023 transitions. [2020-10-11 15:22:00,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:00,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:22:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:01,244 INFO L225 Difference]: With dead ends: 136136 [2020-10-11 15:22:01,245 INFO L226 Difference]: Without dead ends: 136077 [2020-10-11 15:22:01,245 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:22:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136077 states. [2020-10-11 15:22:04,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136077 to 41353. [2020-10-11 15:22:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41353 states. [2020-10-11 15:22:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41353 states to 41353 states and 218039 transitions. [2020-10-11 15:22:04,230 INFO L78 Accepts]: Start accepts. Automaton has 41353 states and 218039 transitions. Word has length 29 [2020-10-11 15:22:04,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:04,230 INFO L481 AbstractCegarLoop]: Abstraction has 41353 states and 218039 transitions. [2020-10-11 15:22:04,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:22:04,230 INFO L276 IsEmpty]: Start isEmpty. Operand 41353 states and 218039 transitions. [2020-10-11 15:22:04,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:04,242 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:04,242 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:04,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable166 [2020-10-11 15:22:04,458 INFO L429 AbstractCegarLoop]: === Iteration 93 === [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-10-11 15:22:04,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:04,458 INFO L82 PathProgramCache]: Analyzing trace with hash -527473920, now seen corresponding path program 5 times [2020-10-11 15:22:04,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:04,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990064291] [2020-10-11 15:22:04,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:04,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990064291] [2020-10-11 15:22:04,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:04,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:04,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882755406] [2020-10-11 15:22:04,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:04,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:04,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:04,511 INFO L87 Difference]: Start difference. First operand 41353 states and 218039 transitions. Second operand 9 states. [2020-10-11 15:22:05,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:05,861 INFO L93 Difference]: Finished difference Result 135187 states and 625168 transitions. [2020-10-11 15:22:05,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:05,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:05,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:06,261 INFO L225 Difference]: With dead ends: 135187 [2020-10-11 15:22:06,262 INFO L226 Difference]: Without dead ends: 135143 [2020-10-11 15:22:06,262 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135143 states. [2020-10-11 15:22:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135143 to 40915. [2020-10-11 15:22:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40915 states. [2020-10-11 15:22:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40915 states to 40915 states and 215544 transitions. [2020-10-11 15:22:09,818 INFO L78 Accepts]: Start accepts. Automaton has 40915 states and 215544 transitions. Word has length 29 [2020-10-11 15:22:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:09,818 INFO L481 AbstractCegarLoop]: Abstraction has 40915 states and 215544 transitions. [2020-10-11 15:22:09,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:09,819 INFO L276 IsEmpty]: Start isEmpty. Operand 40915 states and 215544 transitions. [2020-10-11 15:22:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:09,827 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:09,827 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:09,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2020-10-11 15:22:09,827 INFO L429 AbstractCegarLoop]: === Iteration 94 === [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-10-11 15:22:09,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:09,828 INFO L82 PathProgramCache]: Analyzing trace with hash -527489389, now seen corresponding path program 5 times [2020-10-11 15:22:09,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:09,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185188218] [2020-10-11 15:22:09,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:09,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185188218] [2020-10-11 15:22:09,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:09,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:09,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112522614] [2020-10-11 15:22:09,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:09,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:09,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:09,879 INFO L87 Difference]: Start difference. First operand 40915 states and 215544 transitions. Second operand 9 states. [2020-10-11 15:22:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:11,219 INFO L93 Difference]: Finished difference Result 133251 states and 615922 transitions. [2020-10-11 15:22:11,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:11,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:11,618 INFO L225 Difference]: With dead ends: 133251 [2020-10-11 15:22:11,618 INFO L226 Difference]: Without dead ends: 133207 [2020-10-11 15:22:11,619 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:12,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133207 states. [2020-10-11 15:22:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133207 to 40430. [2020-10-11 15:22:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40430 states. [2020-10-11 15:22:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40430 states to 40430 states and 212865 transitions. [2020-10-11 15:22:14,556 INFO L78 Accepts]: Start accepts. Automaton has 40430 states and 212865 transitions. Word has length 29 [2020-10-11 15:22:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:14,556 INFO L481 AbstractCegarLoop]: Abstraction has 40430 states and 212865 transitions. [2020-10-11 15:22:14,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 40430 states and 212865 transitions. [2020-10-11 15:22:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:14,564 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:14,564 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:14,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2020-10-11 15:22:14,565 INFO L429 AbstractCegarLoop]: === Iteration 95 === [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-10-11 15:22:14,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:14,565 INFO L82 PathProgramCache]: Analyzing trace with hash -527451848, now seen corresponding path program 3 times [2020-10-11 15:22:14,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:14,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529746760] [2020-10-11 15:22:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:14,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529746760] [2020-10-11 15:22:14,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:14,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:14,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614664104] [2020-10-11 15:22:14,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:14,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:14,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:14,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:14,615 INFO L87 Difference]: Start difference. First operand 40430 states and 212865 transitions. Second operand 9 states. [2020-10-11 15:22:15,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:15,976 INFO L93 Difference]: Finished difference Result 132509 states and 612908 transitions. [2020-10-11 15:22:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:15,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:16,371 INFO L225 Difference]: With dead ends: 132509 [2020-10-11 15:22:16,371 INFO L226 Difference]: Without dead ends: 132465 [2020-10-11 15:22:16,371 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132465 states. [2020-10-11 15:22:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132465 to 39940. [2020-10-11 15:22:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39940 states. [2020-10-11 15:22:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39940 states to 39940 states and 210218 transitions. [2020-10-11 15:22:19,824 INFO L78 Accepts]: Start accepts. Automaton has 39940 states and 210218 transitions. Word has length 29 [2020-10-11 15:22:19,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:19,824 INFO L481 AbstractCegarLoop]: Abstraction has 39940 states and 210218 transitions. [2020-10-11 15:22:19,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 39940 states and 210218 transitions. [2020-10-11 15:22:19,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:19,832 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:19,833 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:19,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2020-10-11 15:22:19,833 INFO L429 AbstractCegarLoop]: === Iteration 96 === [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-10-11 15:22:19,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:19,833 INFO L82 PathProgramCache]: Analyzing trace with hash -526134720, now seen corresponding path program 6 times [2020-10-11 15:22:19,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:19,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061842819] [2020-10-11 15:22:19,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:19,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061842819] [2020-10-11 15:22:19,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:19,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:19,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999626590] [2020-10-11 15:22:19,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:19,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:19,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:19,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:19,884 INFO L87 Difference]: Start difference. First operand 39940 states and 210218 transitions. Second operand 9 states. [2020-10-11 15:22:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:21,159 INFO L93 Difference]: Finished difference Result 130945 states and 603941 transitions. [2020-10-11 15:22:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:21,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:21,554 INFO L225 Difference]: With dead ends: 130945 [2020-10-11 15:22:21,554 INFO L226 Difference]: Without dead ends: 130886 [2020-10-11 15:22:21,555 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130886 states. [2020-10-11 15:22:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130886 to 39086. [2020-10-11 15:22:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39086 states. [2020-10-11 15:22:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39086 states to 39086 states and 205652 transitions. [2020-10-11 15:22:24,478 INFO L78 Accepts]: Start accepts. Automaton has 39086 states and 205652 transitions. Word has length 29 [2020-10-11 15:22:24,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:24,478 INFO L481 AbstractCegarLoop]: Abstraction has 39086 states and 205652 transitions. [2020-10-11 15:22:24,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:24,478 INFO L276 IsEmpty]: Start isEmpty. Operand 39086 states and 205652 transitions. [2020-10-11 15:22:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:24,486 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:24,486 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:24,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2020-10-11 15:22:24,486 INFO L429 AbstractCegarLoop]: === Iteration 97 === [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-10-11 15:22:24,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:24,487 INFO L82 PathProgramCache]: Analyzing trace with hash -526148794, now seen corresponding path program 5 times [2020-10-11 15:22:24,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:24,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160164097] [2020-10-11 15:22:24,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:24,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160164097] [2020-10-11 15:22:24,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:24,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:24,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343303186] [2020-10-11 15:22:24,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:24,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:24,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:24,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:24,540 INFO L87 Difference]: Start difference. First operand 39086 states and 205652 transitions. Second operand 9 states. [2020-10-11 15:22:25,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:25,822 INFO L93 Difference]: Finished difference Result 130414 states and 601082 transitions. [2020-10-11 15:22:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:25,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:25,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:26,212 INFO L225 Difference]: With dead ends: 130414 [2020-10-11 15:22:26,212 INFO L226 Difference]: Without dead ends: 130370 [2020-10-11 15:22:26,212 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130370 states. [2020-10-11 15:22:29,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130370 to 38758. [2020-10-11 15:22:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38758 states. [2020-10-11 15:22:29,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38758 states to 38758 states and 203866 transitions. [2020-10-11 15:22:29,614 INFO L78 Accepts]: Start accepts. Automaton has 38758 states and 203866 transitions. Word has length 29 [2020-10-11 15:22:29,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:29,614 INFO L481 AbstractCegarLoop]: Abstraction has 38758 states and 203866 transitions. [2020-10-11 15:22:29,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:29,614 INFO L276 IsEmpty]: Start isEmpty. Operand 38758 states and 203866 transitions. [2020-10-11 15:22:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:29,622 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:29,622 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:29,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2020-10-11 15:22:29,623 INFO L429 AbstractCegarLoop]: === Iteration 98 === [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-10-11 15:22:29,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:29,623 INFO L82 PathProgramCache]: Analyzing trace with hash -526111253, now seen corresponding path program 3 times [2020-10-11 15:22:29,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:29,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813903228] [2020-10-11 15:22:29,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:29,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813903228] [2020-10-11 15:22:29,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:29,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:29,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363348107] [2020-10-11 15:22:29,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:29,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:29,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:29,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:29,680 INFO L87 Difference]: Start difference. First operand 38758 states and 203866 transitions. Second operand 9 states. [2020-10-11 15:22:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:30,990 INFO L93 Difference]: Finished difference Result 129953 states and 599494 transitions. [2020-10-11 15:22:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:30,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:30,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:31,393 INFO L225 Difference]: With dead ends: 129953 [2020-10-11 15:22:31,393 INFO L226 Difference]: Without dead ends: 129909 [2020-10-11 15:22:31,393 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:32,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129909 states. [2020-10-11 15:22:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129909 to 38350. [2020-10-11 15:22:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38350 states. [2020-10-11 15:22:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38350 states to 38350 states and 201720 transitions. [2020-10-11 15:22:34,187 INFO L78 Accepts]: Start accepts. Automaton has 38350 states and 201720 transitions. Word has length 29 [2020-10-11 15:22:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:34,187 INFO L481 AbstractCegarLoop]: Abstraction has 38350 states and 201720 transitions. [2020-10-11 15:22:34,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 38350 states and 201720 transitions. [2020-10-11 15:22:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:34,196 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:34,196 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:34,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2020-10-11 15:22:34,196 INFO L429 AbstractCegarLoop]: === Iteration 99 === [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-10-11 15:22:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:34,197 INFO L82 PathProgramCache]: Analyzing trace with hash -541000429, now seen corresponding path program 6 times [2020-10-11 15:22:34,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:34,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074656505] [2020-10-11 15:22:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:34,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074656505] [2020-10-11 15:22:34,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:34,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:34,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419727848] [2020-10-11 15:22:34,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:34,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:34,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:34,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:34,250 INFO L87 Difference]: Start difference. First operand 38350 states and 201720 transitions. Second operand 9 states. [2020-10-11 15:22:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:35,494 INFO L93 Difference]: Finished difference Result 128408 states and 591144 transitions. [2020-10-11 15:22:35,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:35,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:35,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:36,558 INFO L225 Difference]: With dead ends: 128408 [2020-10-11 15:22:36,558 INFO L226 Difference]: Without dead ends: 128349 [2020-10-11 15:22:36,559 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:37,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128349 states. [2020-10-11 15:22:39,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128349 to 37756. [2020-10-11 15:22:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37756 states. [2020-10-11 15:22:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37756 states to 37756 states and 198597 transitions. [2020-10-11 15:22:39,263 INFO L78 Accepts]: Start accepts. Automaton has 37756 states and 198597 transitions. Word has length 29 [2020-10-11 15:22:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:39,263 INFO L481 AbstractCegarLoop]: Abstraction has 37756 states and 198597 transitions. [2020-10-11 15:22:39,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 37756 states and 198597 transitions. [2020-10-11 15:22:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:39,271 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:39,271 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:39,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2020-10-11 15:22:39,272 INFO L429 AbstractCegarLoop]: === Iteration 100 === [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-10-11 15:22:39,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:39,272 INFO L82 PathProgramCache]: Analyzing trace with hash -540999034, now seen corresponding path program 6 times [2020-10-11 15:22:39,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:39,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978894206] [2020-10-11 15:22:39,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:39,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978894206] [2020-10-11 15:22:39,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:39,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:39,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956981506] [2020-10-11 15:22:39,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:39,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:39,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:39,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:39,323 INFO L87 Difference]: Start difference. First operand 37756 states and 198597 transitions. Second operand 9 states. [2020-10-11 15:22:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:40,678 INFO L93 Difference]: Finished difference Result 127321 states and 585958 transitions. [2020-10-11 15:22:40,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:40,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:40,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:41,094 INFO L225 Difference]: With dead ends: 127321 [2020-10-11 15:22:41,094 INFO L226 Difference]: Without dead ends: 127262 [2020-10-11 15:22:41,094 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127262 states. [2020-10-11 15:22:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127262 to 36966. [2020-10-11 15:22:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36966 states. [2020-10-11 15:22:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36966 states to 36966 states and 194506 transitions. [2020-10-11 15:22:43,909 INFO L78 Accepts]: Start accepts. Automaton has 36966 states and 194506 transitions. Word has length 29 [2020-10-11 15:22:43,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:43,909 INFO L481 AbstractCegarLoop]: Abstraction has 36966 states and 194506 transitions. [2020-10-11 15:22:43,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:43,910 INFO L276 IsEmpty]: Start isEmpty. Operand 36966 states and 194506 transitions. [2020-10-11 15:22:43,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:43,918 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:43,918 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:43,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2020-10-11 15:22:43,918 INFO L429 AbstractCegarLoop]: === Iteration 101 === [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-10-11 15:22:43,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:43,918 INFO L82 PathProgramCache]: Analyzing trace with hash -540976962, now seen corresponding path program 3 times [2020-10-11 15:22:43,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:43,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743170457] [2020-10-11 15:22:43,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:43,977 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:43,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743170457] [2020-10-11 15:22:43,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:43,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:43,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838343210] [2020-10-11 15:22:43,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:43,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:43,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:43,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:43,979 INFO L87 Difference]: Start difference. First operand 36966 states and 194506 transitions. Second operand 9 states. [2020-10-11 15:22:45,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:45,876 INFO L93 Difference]: Finished difference Result 127898 states and 589602 transitions. [2020-10-11 15:22:45,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:45,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:45,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:46,258 INFO L225 Difference]: With dead ends: 127898 [2020-10-11 15:22:46,258 INFO L226 Difference]: Without dead ends: 127854 [2020-10-11 15:22:46,258 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127854 states. [2020-10-11 15:22:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127854 to 36674. [2020-10-11 15:22:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36674 states. [2020-10-11 15:22:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36674 states to 36674 states and 193006 transitions. [2020-10-11 15:22:48,949 INFO L78 Accepts]: Start accepts. Automaton has 36674 states and 193006 transitions. Word has length 29 [2020-10-11 15:22:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:48,949 INFO L481 AbstractCegarLoop]: Abstraction has 36674 states and 193006 transitions. [2020-10-11 15:22:48,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 36674 states and 193006 transitions. [2020-10-11 15:22:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:48,957 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:48,957 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:48,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2020-10-11 15:22:48,957 INFO L429 AbstractCegarLoop]: === Iteration 102 === [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-10-11 15:22:48,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:48,957 INFO L82 PathProgramCache]: Analyzing trace with hash -504923528, now seen corresponding path program 4 times [2020-10-11 15:22:48,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:48,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488227142] [2020-10-11 15:22:48,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:49,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488227142] [2020-10-11 15:22:49,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:49,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:49,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952133418] [2020-10-11 15:22:49,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:49,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:49,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:49,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:49,011 INFO L87 Difference]: Start difference. First operand 36674 states and 193006 transitions. Second operand 9 states. [2020-10-11 15:22:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:50,250 INFO L93 Difference]: Finished difference Result 128860 states and 594173 transitions. [2020-10-11 15:22:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:50,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:50,651 INFO L225 Difference]: With dead ends: 128860 [2020-10-11 15:22:50,651 INFO L226 Difference]: Without dead ends: 128801 [2020-10-11 15:22:50,651 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128801 states. [2020-10-11 15:22:53,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128801 to 36922. [2020-10-11 15:22:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36922 states. [2020-10-11 15:22:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36922 states to 36922 states and 194255 transitions. [2020-10-11 15:22:53,401 INFO L78 Accepts]: Start accepts. Automaton has 36922 states and 194255 transitions. Word has length 29 [2020-10-11 15:22:53,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:53,402 INFO L481 AbstractCegarLoop]: Abstraction has 36922 states and 194255 transitions. [2020-10-11 15:22:53,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 36922 states and 194255 transitions. [2020-10-11 15:22:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:53,410 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:53,410 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:53,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2020-10-11 15:22:53,410 INFO L429 AbstractCegarLoop]: === Iteration 103 === [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-10-11 15:22:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash -504922133, now seen corresponding path program 4 times [2020-10-11 15:22:53,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:53,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750419118] [2020-10-11 15:22:53,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:53,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750419118] [2020-10-11 15:22:53,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:53,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:53,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79231901] [2020-10-11 15:22:53,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:53,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:53,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:53,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:53,462 INFO L87 Difference]: Start difference. First operand 36922 states and 194255 transitions. Second operand 9 states. [2020-10-11 15:22:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:54,728 INFO L93 Difference]: Finished difference Result 127746 states and 588973 transitions. [2020-10-11 15:22:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:54,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:55,768 INFO L225 Difference]: With dead ends: 127746 [2020-10-11 15:22:55,768 INFO L226 Difference]: Without dead ends: 127687 [2020-10-11 15:22:55,768 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127687 states. [2020-10-11 15:22:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127687 to 36885. [2020-10-11 15:22:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36885 states. [2020-10-11 15:22:58,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 194028 transitions. [2020-10-11 15:22:58,274 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 194028 transitions. Word has length 29 [2020-10-11 15:22:58,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:58,274 INFO L481 AbstractCegarLoop]: Abstraction has 36885 states and 194028 transitions. [2020-10-11 15:22:58,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 194028 transitions. [2020-10-11 15:22:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:58,282 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:58,282 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:58,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2020-10-11 15:22:58,282 INFO L429 AbstractCegarLoop]: === Iteration 104 === [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-10-11 15:22:58,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:58,283 INFO L82 PathProgramCache]: Analyzing trace with hash -504937602, now seen corresponding path program 4 times [2020-10-11 15:22:58,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:58,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219258862] [2020-10-11 15:22:58,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:58,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219258862] [2020-10-11 15:22:58,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:58,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:58,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236057346] [2020-10-11 15:22:58,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:58,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:58,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:58,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:58,336 INFO L87 Difference]: Start difference. First operand 36885 states and 194028 transitions. Second operand 9 states. [2020-10-11 15:22:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:59,694 INFO L93 Difference]: Finished difference Result 126643 states and 584111 transitions. [2020-10-11 15:22:59,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:59,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:00,090 INFO L225 Difference]: With dead ends: 126643 [2020-10-11 15:23:00,091 INFO L226 Difference]: Without dead ends: 126584 [2020-10-11 15:23:00,091 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:23:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126584 states. [2020-10-11 15:23:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126584 to 36688. [2020-10-11 15:23:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36688 states. [2020-10-11 15:23:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36688 states to 36688 states and 192991 transitions. [2020-10-11 15:23:02,832 INFO L78 Accepts]: Start accepts. Automaton has 36688 states and 192991 transitions. Word has length 29 [2020-10-11 15:23:02,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:02,832 INFO L481 AbstractCegarLoop]: Abstraction has 36688 states and 192991 transitions. [2020-10-11 15:23:02,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 36688 states and 192991 transitions. [2020-10-11 15:23:02,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:02,840 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:02,840 INFO L421 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:02,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2020-10-11 15:23:02,840 INFO L429 AbstractCegarLoop]: === Iteration 105 === [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-10-11 15:23:02,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash -413562361, now seen corresponding path program 1 times [2020-10-11 15:23:02,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:02,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847180392] [2020-10-11 15:23:02,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-10-11 15:23:02,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847180392] [2020-10-11 15:23:02,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:02,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:23:02,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938908826] [2020-10-11 15:23:02,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:23:02,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:02,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:23:02,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:23:02,863 INFO L87 Difference]: Start difference. First operand 36688 states and 192991 transitions. Second operand 5 states. [2020-10-11 15:23:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:03,296 INFO L93 Difference]: Finished difference Result 61979 states and 317658 transitions. [2020-10-11 15:23:03,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:23:03,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-10-11 15:23:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:03,499 INFO L225 Difference]: With dead ends: 61979 [2020-10-11 15:23:03,499 INFO L226 Difference]: Without dead ends: 61915 [2020-10-11 15:23:03,499 INFO L673 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-10-11 15:23:04,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61915 states. [2020-10-11 15:23:05,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61915 to 45529. [2020-10-11 15:23:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45529 states. [2020-10-11 15:23:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45529 states to 45529 states and 238865 transitions. [2020-10-11 15:23:05,761 INFO L78 Accepts]: Start accepts. Automaton has 45529 states and 238865 transitions. Word has length 29 [2020-10-11 15:23:05,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:05,761 INFO L481 AbstractCegarLoop]: Abstraction has 45529 states and 238865 transitions. [2020-10-11 15:23:05,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:23:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 45529 states and 238865 transitions. [2020-10-11 15:23:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:05,769 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:05,769 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:05,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2020-10-11 15:23:05,769 INFO L429 AbstractCegarLoop]: === Iteration 106 === [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-10-11 15:23:05,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:05,770 INFO L82 PathProgramCache]: Analyzing trace with hash 613734392, now seen corresponding path program 5 times [2020-10-11 15:23:05,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:05,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178438256] [2020-10-11 15:23:05,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:23:05,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178438256] [2020-10-11 15:23:05,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:05,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:23:05,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733611854] [2020-10-11 15:23:05,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:23:05,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:05,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:23:05,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:23:05,821 INFO L87 Difference]: Start difference. First operand 45529 states and 238865 transitions. Second operand 9 states. [2020-10-11 15:23:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:07,197 INFO L93 Difference]: Finished difference Result 150731 states and 702613 transitions. [2020-10-11 15:23:07,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:23:07,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:23:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:07,628 INFO L225 Difference]: With dead ends: 150731 [2020-10-11 15:23:07,628 INFO L226 Difference]: Without dead ends: 150675 [2020-10-11 15:23:07,628 INFO L673 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-10-11 15:23:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150675 states. [2020-10-11 15:23:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150675 to 46190. [2020-10-11 15:23:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46190 states. [2020-10-11 15:23:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46190 states to 46190 states and 242332 transitions. [2020-10-11 15:23:10,953 INFO L78 Accepts]: Start accepts. Automaton has 46190 states and 242332 transitions. Word has length 29 [2020-10-11 15:23:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:10,953 INFO L481 AbstractCegarLoop]: Abstraction has 46190 states and 242332 transitions. [2020-10-11 15:23:10,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 46190 states and 242332 transitions. [2020-10-11 15:23:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:10,962 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:10,962 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:10,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2020-10-11 15:23:10,962 INFO L429 AbstractCegarLoop]: === Iteration 107 === [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-10-11 15:23:10,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:10,962 INFO L82 PathProgramCache]: Analyzing trace with hash 613735787, now seen corresponding path program 5 times [2020-10-11 15:23:10,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:10,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940729532] [2020-10-11 15:23:10,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:23:11,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940729532] [2020-10-11 15:23:11,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:11,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:23:11,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163906191] [2020-10-11 15:23:11,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:23:11,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:11,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:23:11,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:23:11,016 INFO L87 Difference]: Start difference. First operand 46190 states and 242332 transitions. Second operand 9 states. [2020-10-11 15:23:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:12,348 INFO L93 Difference]: Finished difference Result 149511 states and 696801 transitions. [2020-10-11 15:23:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:23:12,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:23:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:12,781 INFO L225 Difference]: With dead ends: 149511 [2020-10-11 15:23:12,781 INFO L226 Difference]: Without dead ends: 149455 [2020-10-11 15:23:12,781 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:23:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149455 states. [2020-10-11 15:23:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149455 to 46554. [2020-10-11 15:23:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46554 states. [2020-10-11 15:23:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46554 states to 46554 states and 244235 transitions. [2020-10-11 15:23:16,779 INFO L78 Accepts]: Start accepts. Automaton has 46554 states and 244235 transitions. Word has length 29 [2020-10-11 15:23:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:16,780 INFO L481 AbstractCegarLoop]: Abstraction has 46554 states and 244235 transitions. [2020-10-11 15:23:16,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:16,780 INFO L276 IsEmpty]: Start isEmpty. Operand 46554 states and 244235 transitions. [2020-10-11 15:23:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:16,788 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:16,788 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:16,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2020-10-11 15:23:16,788 INFO L429 AbstractCegarLoop]: === Iteration 108 === [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-10-11 15:23:16,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:16,789 INFO L82 PathProgramCache]: Analyzing trace with hash 613720318, now seen corresponding path program 5 times [2020-10-11 15:23:16,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:16,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806161588] [2020-10-11 15:23:16,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:23:16,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806161588] [2020-10-11 15:23:16,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:16,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:23:16,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173659355] [2020-10-11 15:23:16,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:23:16,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:16,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:23:16,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:23:16,838 INFO L87 Difference]: Start difference. First operand 46554 states and 244235 transitions. Second operand 9 states. [2020-10-11 15:23:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:18,228 INFO L93 Difference]: Finished difference Result 148338 states and 691501 transitions. [2020-10-11 15:23:18,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:23:18,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:23:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:18,695 INFO L225 Difference]: With dead ends: 148338 [2020-10-11 15:23:18,695 INFO L226 Difference]: Without dead ends: 148282 [2020-10-11 15:23:18,695 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:23:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148282 states. [2020-10-11 15:23:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148282 to 46429. [2020-10-11 15:23:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46429 states. [2020-10-11 15:23:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46429 states to 46429 states and 243498 transitions. [2020-10-11 15:23:21,994 INFO L78 Accepts]: Start accepts. Automaton has 46429 states and 243498 transitions. Word has length 29 [2020-10-11 15:23:21,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:21,994 INFO L481 AbstractCegarLoop]: Abstraction has 46429 states and 243498 transitions. [2020-10-11 15:23:21,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:21,994 INFO L276 IsEmpty]: Start isEmpty. Operand 46429 states and 243498 transitions. [2020-10-11 15:23:22,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:22,003 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:22,003 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:22,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2020-10-11 15:23:22,003 INFO L429 AbstractCegarLoop]: === Iteration 109 === [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-10-11 15:23:22,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:22,003 INFO L82 PathProgramCache]: Analyzing trace with hash 614716472, now seen corresponding path program 6 times [2020-10-11 15:23:22,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:22,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303192990] [2020-10-11 15:23:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:23:22,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303192990] [2020-10-11 15:23:22,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:22,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:23:22,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670903352] [2020-10-11 15:23:22,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:23:22,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:22,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:23:22,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:23:22,053 INFO L87 Difference]: Start difference. First operand 46429 states and 243498 transitions. Second operand 9 states. [2020-10-11 15:23:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:23,444 INFO L93 Difference]: Finished difference Result 148415 states and 691326 transitions. [2020-10-11 15:23:23,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:23:23,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:23:23,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:24,657 INFO L225 Difference]: With dead ends: 148415 [2020-10-11 15:23:24,658 INFO L226 Difference]: Without dead ends: 148344 [2020-10-11 15:23:24,658 INFO L673 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-10-11 15:23:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148344 states. [2020-10-11 15:23:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148344 to 45169. [2020-10-11 15:23:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45169 states. [2020-10-11 15:23:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45169 states to 45169 states and 236894 transitions. [2020-10-11 15:23:27,751 INFO L78 Accepts]: Start accepts. Automaton has 45169 states and 236894 transitions. Word has length 29 [2020-10-11 15:23:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:27,751 INFO L481 AbstractCegarLoop]: Abstraction has 45169 states and 236894 transitions. [2020-10-11 15:23:27,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 45169 states and 236894 transitions. [2020-10-11 15:23:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:27,760 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:27,760 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:27,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2020-10-11 15:23:27,760 INFO L429 AbstractCegarLoop]: === Iteration 110 === [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-10-11 15:23:27,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:27,760 INFO L82 PathProgramCache]: Analyzing trace with hash 616057067, now seen corresponding path program 6 times [2020-10-11 15:23:27,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:27,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274454259] [2020-10-11 15:23:27,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:23:27,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274454259] [2020-10-11 15:23:27,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:27,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:23:27,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382698090] [2020-10-11 15:23:27,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:23:27,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:27,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:23:27,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:23:27,810 INFO L87 Difference]: Start difference. First operand 45169 states and 236894 transitions. Second operand 9 states. [2020-10-11 15:23:29,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:29,330 INFO L93 Difference]: Finished difference Result 147425 states and 686023 transitions. [2020-10-11 15:23:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:23:29,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:23:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:29,754 INFO L225 Difference]: With dead ends: 147425 [2020-10-11 15:23:29,754 INFO L226 Difference]: Without dead ends: 147354 [2020-10-11 15:23:29,755 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:23:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147354 states. [2020-10-11 15:23:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147354 to 43980. [2020-10-11 15:23:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43980 states. [2020-10-11 15:23:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43980 states to 43980 states and 230752 transitions. [2020-10-11 15:23:33,117 INFO L78 Accepts]: Start accepts. Automaton has 43980 states and 230752 transitions. Word has length 29 [2020-10-11 15:23:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:33,117 INFO L481 AbstractCegarLoop]: Abstraction has 43980 states and 230752 transitions. [2020-10-11 15:23:33,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 43980 states and 230752 transitions. [2020-10-11 15:23:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:33,126 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:33,126 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:33,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2020-10-11 15:23:33,126 INFO L429 AbstractCegarLoop]: === Iteration 111 === [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-10-11 15:23:33,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:33,126 INFO L82 PathProgramCache]: Analyzing trace with hash 601191358, now seen corresponding path program 6 times [2020-10-11 15:23:33,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:33,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437543609] [2020-10-11 15:23:33,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:23:33,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437543609] [2020-10-11 15:23:33,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:33,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:23:33,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905280179] [2020-10-11 15:23:33,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:23:33,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:33,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:23:33,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:23:33,178 INFO L87 Difference]: Start difference. First operand 43980 states and 230752 transitions. Second operand 9 states. [2020-10-11 15:23:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:34,901 INFO L93 Difference]: Finished difference Result 146606 states and 682087 transitions. [2020-10-11 15:23:34,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:23:34,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:23:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:35,331 INFO L225 Difference]: With dead ends: 146606 [2020-10-11 15:23:35,331 INFO L226 Difference]: Without dead ends: 146535 [2020-10-11 15:23:35,331 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:23:36,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146535 states. [2020-10-11 15:23:38,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146535 to 42813. [2020-10-11 15:23:38,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42813 states. [2020-10-11 15:23:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42813 states to 42813 states and 224792 transitions. [2020-10-11 15:23:38,684 INFO L78 Accepts]: Start accepts. Automaton has 42813 states and 224792 transitions. Word has length 29 [2020-10-11 15:23:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:38,684 INFO L481 AbstractCegarLoop]: Abstraction has 42813 states and 224792 transitions. [2020-10-11 15:23:38,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 42813 states and 224792 transitions. [2020-10-11 15:23:38,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-11 15:23:38,695 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:38,695 INFO L421 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:38,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2020-10-11 15:23:38,695 INFO L429 AbstractCegarLoop]: === Iteration 112 === [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-10-11 15:23:38,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:38,695 INFO L82 PathProgramCache]: Analyzing trace with hash 58023263, now seen corresponding path program 1 times [2020-10-11 15:23:38,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:38,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569362993] [2020-10-11 15:23:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:23:38,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:23:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:23:38,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:23:38,710 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:23:38,710 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:23:38,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2020-10-11 15:23:38,711 WARN L371 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-11 15:23:38,711 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2020-10-11 15:23:38,726 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,727 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,727 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,727 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,727 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,727 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,727 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,728 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,728 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,728 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,728 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,728 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,728 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,728 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,729 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,729 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,729 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,729 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,729 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,729 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,729 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,730 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,730 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,730 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,730 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,730 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,730 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,730 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,730 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,730 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,730 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,731 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,731 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,731 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,731 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,731 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,731 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread7of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,731 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread7of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,731 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,731 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,731 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,731 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,731 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,732 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,732 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,732 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,732 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,732 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,732 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,732 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,732 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,732 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,732 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,732 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,732 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,733 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,733 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,733 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,733 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,733 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,733 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,733 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,733 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,740 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,740 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,740 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,740 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,740 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,741 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,742 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,742 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,742 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,742 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,743 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,743 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,743 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,743 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,743 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,744 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,744 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,744 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,744 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,744 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,745 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,745 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,745 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,745 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,745 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,747 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,747 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,747 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,747 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,748 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,749 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,749 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,749 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,749 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,749 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:38,761 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-10-11 15:23:38,762 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:23:38,762 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:23:38,762 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:23:38,762 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:23:38,762 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:23:38,762 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:23:38,762 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:23:38,762 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:23:38,765 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:23:38,765 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 159 transitions, 472 flow [2020-10-11 15:23:38,765 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 159 transitions, 472 flow [2020-10-11 15:23:38,765 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 181 places, 159 transitions, 472 flow [2020-10-11 15:23:38,786 INFO L129 PetriNetUnfolder]: 9/193 cut-off events. [2020-10-11 15:23:38,786 INFO L130 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2020-10-11 15:23:38,788 INFO L80 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 193 events. 9/193 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 334 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 237. Up to 16 conditions per place. [2020-10-11 15:23:38,795 INFO L117 LiptonReduction]: Number of co-enabled transitions 4448 [2020-10-11 15:23:41,418 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-10-11 15:23:41,520 INFO L132 LiptonReduction]: Checked pairs total: 7296 [2020-10-11 15:23:41,521 INFO L134 LiptonReduction]: Total number of compositions: 148 [2020-10-11 15:23:41,521 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 51 transitions, 256 flow [2020-10-11 15:23:51,044 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 55763 states. [2020-10-11 15:23:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 55763 states. [2020-10-11 15:23:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:23:51,044 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:51,044 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:23:51,044 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:23:51,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:51,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1622843, now seen corresponding path program 1 times [2020-10-11 15:23:51,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:51,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334456518] [2020-10-11 15:23:51,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:23:51,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334456518] [2020-10-11 15:23:51,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:51,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:23:51,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37000507] [2020-10-11 15:23:51,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:23:51,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:51,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:23:51,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:23:51,052 INFO L87 Difference]: Start difference. First operand 55763 states. Second operand 3 states. [2020-10-11 15:23:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:51,421 INFO L93 Difference]: Finished difference Result 54360 states and 318970 transitions. [2020-10-11 15:23:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:23:51,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:23:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:51,603 INFO L225 Difference]: With dead ends: 54360 [2020-10-11 15:23:51,603 INFO L226 Difference]: Without dead ends: 51079 [2020-10-11 15:23:51,603 INFO L673 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-10-11 15:23:54,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51079 states. [2020-10-11 15:23:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51079 to 51079. [2020-10-11 15:23:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51079 states. [2020-10-11 15:23:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51079 states to 51079 states and 298193 transitions. [2020-10-11 15:23:55,777 INFO L78 Accepts]: Start accepts. Automaton has 51079 states and 298193 transitions. Word has length 3 [2020-10-11 15:23:55,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:55,778 INFO L481 AbstractCegarLoop]: Abstraction has 51079 states and 298193 transitions. [2020-10-11 15:23:55,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:23:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 51079 states and 298193 transitions. [2020-10-11 15:23:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:23:55,778 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:55,778 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:55,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2020-10-11 15:23:55,778 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:23:55,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1940021698, now seen corresponding path program 1 times [2020-10-11 15:23:55,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:55,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652586891] [2020-10-11 15:23:55,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:55,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:23:55,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652586891] [2020-10-11 15:23:55,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:55,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:23:55,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763532353] [2020-10-11 15:23:55,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:23:55,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:55,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:23:55,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:23:55,794 INFO L87 Difference]: Start difference. First operand 51079 states and 298193 transitions. Second operand 5 states. [2020-10-11 15:23:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:56,439 INFO L93 Difference]: Finished difference Result 96937 states and 538177 transitions. [2020-10-11 15:23:56,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:23:56,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-11 15:23:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:56,764 INFO L225 Difference]: With dead ends: 96937 [2020-10-11 15:23:56,764 INFO L226 Difference]: Without dead ends: 96928 [2020-10-11 15:23:56,765 INFO L673 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-10-11 15:24:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96928 states. [2020-10-11 15:24:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96928 to 61361. [2020-10-11 15:24:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61361 states. [2020-10-11 15:24:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61361 states to 61361 states and 361700 transitions. [2020-10-11 15:24:07,288 INFO L78 Accepts]: Start accepts. Automaton has 61361 states and 361700 transitions. Word has length 9 [2020-10-11 15:24:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:24:07,288 INFO L481 AbstractCegarLoop]: Abstraction has 61361 states and 361700 transitions. [2020-10-11 15:24:07,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:24:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 61361 states and 361700 transitions. [2020-10-11 15:24:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:24:07,288 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:24:07,288 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:24:07,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2020-10-11 15:24:07,289 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:24:07,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:24:07,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1408430290, now seen corresponding path program 1 times [2020-10-11 15:24:07,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:24:07,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034842547] [2020-10-11 15:24:07,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:24:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:24:07,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:24:07,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034842547] [2020-10-11 15:24:07,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:24:07,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:24:07,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206434337] [2020-10-11 15:24:07,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:24:07,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:24:07,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:24:07,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:24:07,307 INFO L87 Difference]: Start difference. First operand 61361 states and 361700 transitions. Second operand 5 states. [2020-10-11 15:24:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:24:08,049 INFO L93 Difference]: Finished difference Result 115105 states and 647870 transitions. [2020-10-11 15:24:08,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:24:08,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:24:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:24:08,439 INFO L225 Difference]: With dead ends: 115105 [2020-10-11 15:24:08,439 INFO L226 Difference]: Without dead ends: 115086 [2020-10-11 15:24:08,439 INFO L673 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-10-11 15:24:13,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115086 states. [2020-10-11 15:24:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115086 to 74729. [2020-10-11 15:24:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74729 states. [2020-10-11 15:24:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74729 states to 74729 states and 446528 transitions. [2020-10-11 15:24:15,696 INFO L78 Accepts]: Start accepts. Automaton has 74729 states and 446528 transitions. Word has length 13 [2020-10-11 15:24:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:24:15,696 INFO L481 AbstractCegarLoop]: Abstraction has 74729 states and 446528 transitions. [2020-10-11 15:24:15,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:24:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 74729 states and 446528 transitions. [2020-10-11 15:24:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:24:15,697 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:24:15,697 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:24:15,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2020-10-11 15:24:15,697 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:24:15,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:24:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash 586807343, now seen corresponding path program 1 times [2020-10-11 15:24:15,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:24:15,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314954781] [2020-10-11 15:24:15,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:24:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:24:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:24:15,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314954781] [2020-10-11 15:24:15,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:24:15,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:24:15,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977239413] [2020-10-11 15:24:15,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:24:15,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:24:15,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:24:15,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:24:15,730 INFO L87 Difference]: Start difference. First operand 74729 states and 446528 transitions. Second operand 7 states. [2020-10-11 15:24:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:24:16,958 INFO L93 Difference]: Finished difference Result 183405 states and 977356 transitions. [2020-10-11 15:24:16,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:24:16,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 15:24:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:24:17,617 INFO L225 Difference]: With dead ends: 183405 [2020-10-11 15:24:17,617 INFO L226 Difference]: Without dead ends: 183386 [2020-10-11 15:24:17,617 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:24:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183386 states. [2020-10-11 15:24:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183386 to 74375. [2020-10-11 15:24:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74375 states. [2020-10-11 15:24:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74375 states to 74375 states and 444112 transitions. [2020-10-11 15:24:32,588 INFO L78 Accepts]: Start accepts. Automaton has 74375 states and 444112 transitions. Word has length 15 [2020-10-11 15:24:32,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:24:32,589 INFO L481 AbstractCegarLoop]: Abstraction has 74375 states and 444112 transitions. [2020-10-11 15:24:32,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:24:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 74375 states and 444112 transitions. [2020-10-11 15:24:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:24:32,589 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:24:32,589 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:24:32,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2020-10-11 15:24:32,589 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:24:32,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:24:32,590 INFO L82 PathProgramCache]: Analyzing trace with hash 576093743, now seen corresponding path program 2 times [2020-10-11 15:24:32,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:24:32,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914585721] [2020-10-11 15:24:32,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:24:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:24:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:24:32,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914585721] [2020-10-11 15:24:32,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:24:32,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:24:32,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708651356] [2020-10-11 15:24:32,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:24:32,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:24:32,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:24:32,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:24:32,623 INFO L87 Difference]: Start difference. First operand 74375 states and 444112 transitions. Second operand 7 states. [2020-10-11 15:24:33,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:24:33,922 INFO L93 Difference]: Finished difference Result 188187 states and 1003599 transitions. [2020-10-11 15:24:33,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:24:33,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 15:24:33,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:24:36,256 INFO L225 Difference]: With dead ends: 188187 [2020-10-11 15:24:36,257 INFO L226 Difference]: Without dead ends: 188167 [2020-10-11 15:24:36,257 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:24:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188167 states. [2020-10-11 15:24:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188167 to 73326. [2020-10-11 15:24:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73326 states. [2020-10-11 15:24:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73326 states to 73326 states and 437534 transitions. [2020-10-11 15:24:45,119 INFO L78 Accepts]: Start accepts. Automaton has 73326 states and 437534 transitions. Word has length 15 [2020-10-11 15:24:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:24:45,119 INFO L481 AbstractCegarLoop]: Abstraction has 73326 states and 437534 transitions. [2020-10-11 15:24:45,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:24:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 73326 states and 437534 transitions. [2020-10-11 15:24:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 15:24:45,120 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:24:45,120 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:24:45,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2020-10-11 15:24:45,120 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:24:45,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:24:45,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1852086090, now seen corresponding path program 1 times [2020-10-11 15:24:45,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:24:45,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748413979] [2020-10-11 15:24:45,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:24:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:24:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:24:45,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748413979] [2020-10-11 15:24:45,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:24:45,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:24:45,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678618397] [2020-10-11 15:24:45,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:24:45,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:24:45,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:24:45,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:24:45,140 INFO L87 Difference]: Start difference. First operand 73326 states and 437534 transitions. Second operand 5 states. [2020-10-11 15:24:46,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:24:46,056 INFO L93 Difference]: Finished difference Result 136306 states and 779274 transitions. [2020-10-11 15:24:46,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:24:46,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-11 15:24:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:24:46,560 INFO L225 Difference]: With dead ends: 136306 [2020-10-11 15:24:46,560 INFO L226 Difference]: Without dead ends: 136270 [2020-10-11 15:24:46,560 INFO L673 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-10-11 15:24:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136270 states. [2020-10-11 15:24:55,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136270 to 91328. [2020-10-11 15:24:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91328 states. [2020-10-11 15:24:55,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91328 states to 91328 states and 551878 transitions. [2020-10-11 15:24:55,546 INFO L78 Accepts]: Start accepts. Automaton has 91328 states and 551878 transitions. Word has length 17 [2020-10-11 15:24:55,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:24:55,546 INFO L481 AbstractCegarLoop]: Abstraction has 91328 states and 551878 transitions. [2020-10-11 15:24:55,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:24:55,547 INFO L276 IsEmpty]: Start isEmpty. Operand 91328 states and 551878 transitions. [2020-10-11 15:24:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:24:55,547 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:24:55,547 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:24:55,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2020-10-11 15:24:55,547 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:24:55,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:24:55,548 INFO L82 PathProgramCache]: Analyzing trace with hash 805259199, now seen corresponding path program 1 times [2020-10-11 15:24:55,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:24:55,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156085889] [2020-10-11 15:24:55,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:24:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:24:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:24:55,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156085889] [2020-10-11 15:24:55,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023217073] [2020-10-11 15:24:55,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:24:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:24:55,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:24:55,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:24:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:24:55,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:24:55,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-11 15:24:55,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947663876] [2020-10-11 15:24:55,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:24:55,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:24:55,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:24:55,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:24:55,680 INFO L87 Difference]: Start difference. First operand 91328 states and 551878 transitions. Second operand 7 states. [2020-10-11 15:24:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:24:58,988 INFO L93 Difference]: Finished difference Result 220702 states and 1196059 transitions. [2020-10-11 15:24:58,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:24:58,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:24:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:24:59,736 INFO L225 Difference]: With dead ends: 220702 [2020-10-11 15:24:59,736 INFO L226 Difference]: Without dead ends: 220672 [2020-10-11 15:24:59,736 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 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-10-11 15:25:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220672 states. [2020-10-11 15:25:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220672 to 92876. [2020-10-11 15:25:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92876 states. [2020-10-11 15:25:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92876 states to 92876 states and 560664 transitions. [2020-10-11 15:25:13,393 INFO L78 Accepts]: Start accepts. Automaton has 92876 states and 560664 transitions. Word has length 19 [2020-10-11 15:25:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:25:13,394 INFO L481 AbstractCegarLoop]: Abstraction has 92876 states and 560664 transitions. [2020-10-11 15:25:13,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:25:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 92876 states and 560664 transitions. [2020-10-11 15:25:13,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:25:13,394 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:25:13,394 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:25:13,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193,79 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:25:13,595 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:25:13,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:25:13,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1738279999, now seen corresponding path program 2 times [2020-10-11 15:25:13,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:25:13,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415462136] [2020-10-11 15:25:13,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:25:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:25:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:25:13,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415462136] [2020-10-11 15:25:13,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:25:13,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:25:13,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259345314] [2020-10-11 15:25:13,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:25:13,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:25:13,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:25:13,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:25:13,631 INFO L87 Difference]: Start difference. First operand 92876 states and 560664 transitions. Second operand 7 states. [2020-10-11 15:25:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:25:21,100 INFO L93 Difference]: Finished difference Result 226856 states and 1230554 transitions. [2020-10-11 15:25:21,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:25:21,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:25:21,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:25:21,881 INFO L225 Difference]: With dead ends: 226856 [2020-10-11 15:25:21,881 INFO L226 Difference]: Without dead ends: 226815 [2020-10-11 15:25:21,881 INFO L673 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-10-11 15:25:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226815 states. [2020-10-11 15:25:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226815 to 91841. [2020-10-11 15:25:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91841 states. [2020-10-11 15:25:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91841 states to 91841 states and 554890 transitions. [2020-10-11 15:25:32,405 INFO L78 Accepts]: Start accepts. Automaton has 91841 states and 554890 transitions. Word has length 19 [2020-10-11 15:25:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:25:32,405 INFO L481 AbstractCegarLoop]: Abstraction has 91841 states and 554890 transitions. [2020-10-11 15:25:32,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:25:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 91841 states and 554890 transitions. [2020-10-11 15:25:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:25:32,406 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:25:32,406 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:25:32,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2020-10-11 15:25:32,406 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:25:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:25:32,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1738268839, now seen corresponding path program 1 times [2020-10-11 15:25:32,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:25:32,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252956051] [2020-10-11 15:25:32,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:25:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:25:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:25:32,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252956051] [2020-10-11 15:25:32,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:25:32,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:25:32,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020810597] [2020-10-11 15:25:32,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:25:32,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:25:32,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:25:32,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:25:32,438 INFO L87 Difference]: Start difference. First operand 91841 states and 554890 transitions. Second operand 7 states. [2020-10-11 15:25:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:25:35,679 INFO L93 Difference]: Finished difference Result 229929 states and 1248843 transitions. [2020-10-11 15:25:35,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:25:35,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:25:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:25:36,470 INFO L225 Difference]: With dead ends: 229929 [2020-10-11 15:25:36,470 INFO L226 Difference]: Without dead ends: 229888 [2020-10-11 15:25:36,470 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 Received shutdown request... [2020-10-11 15:25:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229888 states. [2020-10-11 15:25:44,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2020-10-11 15:25:44,144 WARN L546 AbstractCegarLoop]: Verification canceled [2020-10-11 15:25:44,146 WARN L235 ceAbstractionStarter]: Timeout [2020-10-11 15:25:44,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:25:44 BasicIcfg [2020-10-11 15:25:44,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 15:25:44,147 INFO L168 Benchmark]: Toolchain (without parser) took 771961.81 ms. Allocated memory was 250.6 MB in the beginning and 5.4 GB in the end (delta: 5.1 GB). Free memory was 205.1 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 4.2 GB. Max. memory is 14.2 GB. [2020-10-11 15:25:44,147 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 15:25:44,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.05 ms. Allocated memory was 250.6 MB in the beginning and 311.4 MB in the end (delta: 60.8 MB). Free memory was 205.1 MB in the beginning and 264.7 MB in the end (delta: -59.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 14.2 GB. [2020-10-11 15:25:44,148 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.20 ms. Allocated memory is still 311.4 MB. Free memory was 264.7 MB in the beginning and 262.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:25:44,148 INFO L168 Benchmark]: Boogie Preprocessor took 60.40 ms. Allocated memory is still 311.4 MB. Free memory was 262.2 MB in the beginning and 259.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:25:44,148 INFO L168 Benchmark]: RCFGBuilder took 356.27 ms. Allocated memory is still 311.4 MB. Free memory was 259.7 MB in the beginning and 240.4 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 14.2 GB. [2020-10-11 15:25:44,149 INFO L168 Benchmark]: TraceAbstraction took 770762.71 ms. Allocated memory was 311.4 MB in the beginning and 5.4 GB in the end (delta: 5.1 GB). Free memory was 240.4 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 4.2 GB. Max. memory is 14.2 GB. [2020-10-11 15:25:44,150 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.27 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 696.05 ms. Allocated memory was 250.6 MB in the beginning and 311.4 MB in the end (delta: 60.8 MB). Free memory was 205.1 MB in the beginning and 264.7 MB in the end (delta: -59.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 80.20 ms. Allocated memory is still 311.4 MB. Free memory was 264.7 MB in the beginning and 262.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 60.40 ms. Allocated memory is still 311.4 MB. Free memory was 262.2 MB in the beginning and 259.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 356.27 ms. Allocated memory is still 311.4 MB. Free memory was 259.7 MB in the beginning and 240.4 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 770762.71 ms. Allocated memory was 311.4 MB in the beginning and 5.4 GB in the end (delta: 5.1 GB). Free memory was 240.4 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 4.2 GB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 484 VarBasedMoverChecksPositive, 4 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 4 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 3 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 1.2s, 55 PlacesBefore, 18 PlacesAfterwards, 51 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 5 FixpointIterations, 13 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 47 TotalNumberOfCompositions, 670 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 726 VarBasedMoverChecksPositive, 8 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 8 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 32 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 1.1s, 76 PlacesBefore, 31 PlacesAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 5 FixpointIterations, 25 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 62 TotalNumberOfCompositions, 1240 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 945 VarBasedMoverChecksPositive, 18 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 18 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 39 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 1.4s, 97 PlacesBefore, 41 PlacesAfterwards, 87 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 5 FixpointIterations, 32 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 77 TotalNumberOfCompositions, 2157 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1337 VarBasedMoverChecksPositive, 21 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 76 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 1.6s, 118 PlacesBefore, 51 PlacesAfterwards, 105 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 5 FixpointIterations, 43 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 5 ConcurrentYvCompositions, 5 ChoiceCompositions, 97 TotalNumberOfCompositions, 2978 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1675 VarBasedMoverChecksPositive, 29 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 29 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 63 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 1.8s, 139 PlacesBefore, 61 PlacesAfterwards, 123 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 5 FixpointIterations, 59 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 5 ConcurrentYvCompositions, 6 ChoiceCompositions, 121 TotalNumberOfCompositions, 4168 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2181 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 36 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 113 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.0s, 160 PlacesBefore, 71 PlacesAfterwards, 141 TransitionsBefore, 45 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 5 FixpointIterations, 66 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 134 TotalNumberOfCompositions, 5372 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2735 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 127 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.7s, 181 PlacesBefore, 81 PlacesAfterwards, 159 TransitionsBefore, 51 TransitionsAfterwards, 4448 CoEnabledTransitionPairs, 5 FixpointIterations, 74 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 3 ConcurrentYvCompositions, 8 ChoiceCompositions, 148 TotalNumberOfCompositions, 7296 MoverChecksTotal - 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 7 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 770.2s, OverallIterations: 196, TraceHistogramMax: 7, AutomataDifference: 260.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 23.7s, HoareTripleCheckerStatistics: 15831 SDtfs, 49271 SDslu, 58156 SDs, 0 SdLazy, 65436 SolverSat, 5072 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6865 GetRequests, 1694 SyntacticMatches, 0 SemanticMatches, 5171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60653 ImplicationChecksByTransitivity, 51.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92876occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 449.3s AutomataMinimizationTime, 190 MinimizatonAttempts, 11270369 StatesRemovedByMinimization, 181 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 6328 NumberOfCodeBlocks, 6252 NumberOfCodeBlocksAsserted, 329 NumberOfCheckSat, 5942 ConstructedInterpolants, 0 QuantifiedInterpolants, 423204 SizeOfPredicates, 456 NumberOfNonLiveVariables, 9748 ConjunctsInSsa, 612 ConjunctsInUnsatCore, 268 InterpolantComputations, 112 PerfectInterpolantSequences, 3236/4682 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