/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:30:15,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:30:15,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:30:15,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:30:15,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:30:15,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:30:15,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:30:15,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:30:15,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:30:15,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:30:15,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:30:15,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:30:15,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:30:15,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:30:15,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:30:15,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:30:15,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:30:15,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:30:15,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:30:15,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:30:15,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:30:15,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:30:15,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:30:15,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:30:15,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:30:15,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:30:15,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:30:15,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:30:15,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:30:15,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:30:15,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:30:15,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:30:15,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:30:15,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:30:15,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:30:15,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:30:15,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:30:15,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:30:15,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:30:15,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:30:15,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:30:15,987 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:30:16,009 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:30:16,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:30:16,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:30:16,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:30:16,011 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:30:16,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:30:16,011 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:30:16,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:30:16,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:30:16,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:30:16,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:30:16,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:30:16,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:30:16,012 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:30:16,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:30:16,013 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:30:16,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:30:16,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:30:16,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:30:16,014 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:30:16,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:30:16,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:30:16,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:30:16,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:30:16,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:30:16,015 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:30:16,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:30:16,015 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:30:16,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:30:16,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:30:16,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:30:16,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:30:16,294 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:30:16,295 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:30:16,295 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2020-10-05 23:30:16,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3195bf9/8c0471821f1649feada6dd5b38064c95/FLAG0342813b3 [2020-10-05 23:30:16,949 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:30:16,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2020-10-05 23:30:16,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3195bf9/8c0471821f1649feada6dd5b38064c95/FLAG0342813b3 [2020-10-05 23:30:17,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3195bf9/8c0471821f1649feada6dd5b38064c95 [2020-10-05 23:30:17,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:30:17,225 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:30:17,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:30:17,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:30:17,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:30:17,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:30:17" (1/1) ... [2020-10-05 23:30:17,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d6dd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:17, skipping insertion in model container [2020-10-05 23:30:17,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:30:17" (1/1) ... [2020-10-05 23:30:17,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:30:17,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:30:17,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:30:17,804 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:30:17,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:30:17,950 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:30:17,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:17 WrapperNode [2020-10-05 23:30:17,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:30:17,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:30:17,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:30:17,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:30:17,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:17" (1/1) ... [2020-10-05 23:30:17,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:17" (1/1) ... [2020-10-05 23:30:18,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:30:18,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:30:18,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:30:18,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:30:18,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:17" (1/1) ... [2020-10-05 23:30:18,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:17" (1/1) ... [2020-10-05 23:30:18,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:17" (1/1) ... [2020-10-05 23:30:18,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:17" (1/1) ... [2020-10-05 23:30:18,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:17" (1/1) ... [2020-10-05 23:30:18,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:17" (1/1) ... [2020-10-05 23:30:18,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:17" (1/1) ... [2020-10-05 23:30:18,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:30:18,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:30:18,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:30:18,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:30:18,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:17" (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-05 23:30:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:30:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:30:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:30:18,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:30:18,161 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:30:18,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:30:18,161 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:30:18,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:30:18,162 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:30:18,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:30:18,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:30:18,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:30:18,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:30:18,165 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:30:20,160 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:30:20,161 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:30:20,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:30:20 BoogieIcfgContainer [2020-10-05 23:30:20,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:30:20,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:30:20,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:30:20,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:30:20,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:30:17" (1/3) ... [2020-10-05 23:30:20,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ed9373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:30:20, skipping insertion in model container [2020-10-05 23:30:20,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:17" (2/3) ... [2020-10-05 23:30:20,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ed9373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:30:20, skipping insertion in model container [2020-10-05 23:30:20,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:30:20" (3/3) ... [2020-10-05 23:30:20,171 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2020-10-05 23:30:20,182 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:30:20,182 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:30:20,190 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:30:20,191 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:30:20,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,222 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,222 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,226 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,226 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,226 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,227 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,230 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,230 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,236 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,237 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,237 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,245 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,245 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,249 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,250 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:20,266 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:30:20,287 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:30:20,287 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:30:20,288 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:30:20,288 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:30:20,288 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:30:20,288 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:30:20,288 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:30:20,288 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:30:20,305 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 205 flow [2020-10-05 23:30:20,308 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-10-05 23:30:20,356 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-05 23:30:20,357 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:30:20,362 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-05 23:30:20,365 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-10-05 23:30:20,391 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-05 23:30:20,391 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:30:20,392 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-05 23:30:20,394 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1724 [2020-10-05 23:30:20,395 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:30:21,535 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 23:30:23,302 WARN L193 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-05 23:30:23,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-05 23:30:23,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:30:23,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 23:30:23,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:30:24,161 WARN L193 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-05 23:30:25,063 WARN L193 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-05 23:30:25,392 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-05 23:30:26,498 WARN L193 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-05 23:30:26,808 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-05 23:30:27,045 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-05 23:30:27,406 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-10-05 23:30:27,529 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-05 23:30:27,536 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5143 [2020-10-05 23:30:27,536 INFO L214 etLargeBlockEncoding]: Total number of compositions: 77 [2020-10-05 23:30:27,540 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 27 transitions, 69 flow [2020-10-05 23:30:27,598 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 972 states. [2020-10-05 23:30:27,601 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states. [2020-10-05 23:30:27,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:30:27,607 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:27,608 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:30:27,609 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:27,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:27,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1010127834, now seen corresponding path program 1 times [2020-10-05 23:30:27,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:27,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776692221] [2020-10-05 23:30:27,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:27,894 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-05 23:30:27,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776692221] [2020-10-05 23:30:27,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:27,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:30:27,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109713096] [2020-10-05 23:30:27,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:30:27,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:27,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:30:27,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:27,920 INFO L87 Difference]: Start difference. First operand 972 states. Second operand 3 states. [2020-10-05 23:30:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:28,034 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-05 23:30:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:30:28,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:30:28,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:28,062 INFO L225 Difference]: With dead ends: 812 [2020-10-05 23:30:28,063 INFO L226 Difference]: Without dead ends: 662 [2020-10-05 23:30:28,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:28,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-10-05 23:30:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2020-10-05 23:30:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2020-10-05 23:30:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2020-10-05 23:30:28,208 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 5 [2020-10-05 23:30:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:28,209 INFO L479 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2020-10-05 23:30:28,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:30:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2020-10-05 23:30:28,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:30:28,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:28,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:28,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:30:28,211 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:28,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:28,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1151164450, now seen corresponding path program 1 times [2020-10-05 23:30:28,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:28,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780378320] [2020-10-05 23:30:28,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:28,308 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-05 23:30:28,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780378320] [2020-10-05 23:30:28,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:28,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:30:28,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77269729] [2020-10-05 23:30:28,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:30:28,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:28,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:30:28,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:28,312 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states. [2020-10-05 23:30:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:28,326 INFO L93 Difference]: Finished difference Result 612 states and 1880 transitions. [2020-10-05 23:30:28,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:30:28,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:30:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:28,337 INFO L225 Difference]: With dead ends: 612 [2020-10-05 23:30:28,337 INFO L226 Difference]: Without dead ends: 612 [2020-10-05 23:30:28,339 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:28,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-10-05 23:30:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2020-10-05 23:30:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-10-05 23:30:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1880 transitions. [2020-10-05 23:30:28,373 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1880 transitions. Word has length 9 [2020-10-05 23:30:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:28,376 INFO L479 AbstractCegarLoop]: Abstraction has 612 states and 1880 transitions. [2020-10-05 23:30:28,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:30:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1880 transitions. [2020-10-05 23:30:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:30:28,381 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:28,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:28,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:30:28,382 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:28,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1832522476, now seen corresponding path program 1 times [2020-10-05 23:30:28,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:28,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101512922] [2020-10-05 23:30:28,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:28,508 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-05 23:30:28,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101512922] [2020-10-05 23:30:28,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:28,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:30:28,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52416446] [2020-10-05 23:30:28,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:30:28,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:28,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:30:28,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:30:28,511 INFO L87 Difference]: Start difference. First operand 612 states and 1880 transitions. Second operand 4 states. [2020-10-05 23:30:28,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:28,578 INFO L93 Difference]: Finished difference Result 604 states and 1850 transitions. [2020-10-05 23:30:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:30:28,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-05 23:30:28,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:28,584 INFO L225 Difference]: With dead ends: 604 [2020-10-05 23:30:28,584 INFO L226 Difference]: Without dead ends: 604 [2020-10-05 23:30:28,585 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:30:28,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-10-05 23:30:28,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2020-10-05 23:30:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2020-10-05 23:30:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1850 transitions. [2020-10-05 23:30:28,606 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1850 transitions. Word has length 11 [2020-10-05 23:30:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:28,606 INFO L479 AbstractCegarLoop]: Abstraction has 604 states and 1850 transitions. [2020-10-05 23:30:28,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:30:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1850 transitions. [2020-10-05 23:30:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:30:28,609 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:28,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:28,609 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:30:28,609 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:28,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:28,610 INFO L82 PathProgramCache]: Analyzing trace with hash 972711313, now seen corresponding path program 1 times [2020-10-05 23:30:28,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:28,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780431779] [2020-10-05 23:30:28,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:28,779 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-05 23:30:28,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780431779] [2020-10-05 23:30:28,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:28,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:28,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296879257] [2020-10-05 23:30:28,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:30:28,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:28,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:30:28,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:28,783 INFO L87 Difference]: Start difference. First operand 604 states and 1850 transitions. Second operand 5 states. [2020-10-05 23:30:28,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:28,874 INFO L93 Difference]: Finished difference Result 596 states and 1818 transitions. [2020-10-05 23:30:28,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:30:28,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 23:30:28,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:28,880 INFO L225 Difference]: With dead ends: 596 [2020-10-05 23:30:28,881 INFO L226 Difference]: Without dead ends: 596 [2020-10-05 23:30:28,881 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-10-05 23:30:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2020-10-05 23:30:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2020-10-05 23:30:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1818 transitions. [2020-10-05 23:30:28,902 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1818 transitions. Word has length 12 [2020-10-05 23:30:28,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:28,902 INFO L479 AbstractCegarLoop]: Abstraction has 596 states and 1818 transitions. [2020-10-05 23:30:28,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:30:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1818 transitions. [2020-10-05 23:30:28,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:30:28,908 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:28,908 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:28,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:30:28,908 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:28,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:28,909 INFO L82 PathProgramCache]: Analyzing trace with hash 116983307, now seen corresponding path program 1 times [2020-10-05 23:30:28,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:28,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952669628] [2020-10-05 23:30:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:29,003 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-05 23:30:29,004 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952669628] [2020-10-05 23:30:29,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:29,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:30:29,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166503360] [2020-10-05 23:30:29,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:30:29,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:29,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:30:29,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:30:29,006 INFO L87 Difference]: Start difference. First operand 596 states and 1818 transitions. Second operand 4 states. [2020-10-05 23:30:29,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:29,073 INFO L93 Difference]: Finished difference Result 606 states and 1849 transitions. [2020-10-05 23:30:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:30:29,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-05 23:30:29,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:29,080 INFO L225 Difference]: With dead ends: 606 [2020-10-05 23:30:29,080 INFO L226 Difference]: Without dead ends: 606 [2020-10-05 23:30:29,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:30:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-10-05 23:30:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 602. [2020-10-05 23:30:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2020-10-05 23:30:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1835 transitions. [2020-10-05 23:30:29,101 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1835 transitions. Word has length 13 [2020-10-05 23:30:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:29,102 INFO L479 AbstractCegarLoop]: Abstraction has 602 states and 1835 transitions. [2020-10-05 23:30:29,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:30:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1835 transitions. [2020-10-05 23:30:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:30:29,104 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:29,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:29,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:30:29,104 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:29,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:29,104 INFO L82 PathProgramCache]: Analyzing trace with hash -569651503, now seen corresponding path program 2 times [2020-10-05 23:30:29,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:29,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019162334] [2020-10-05 23:30:29,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:29,206 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-05 23:30:29,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019162334] [2020-10-05 23:30:29,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:29,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:29,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956914690] [2020-10-05 23:30:29,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:30:29,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:29,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:30:29,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:29,208 INFO L87 Difference]: Start difference. First operand 602 states and 1835 transitions. Second operand 5 states. [2020-10-05 23:30:29,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:29,295 INFO L93 Difference]: Finished difference Result 594 states and 1808 transitions. [2020-10-05 23:30:29,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:30:29,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:30:29,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:29,301 INFO L225 Difference]: With dead ends: 594 [2020-10-05 23:30:29,301 INFO L226 Difference]: Without dead ends: 594 [2020-10-05 23:30:29,301 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-10-05 23:30:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 584. [2020-10-05 23:30:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-10-05 23:30:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1777 transitions. [2020-10-05 23:30:29,322 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1777 transitions. Word has length 13 [2020-10-05 23:30:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:29,323 INFO L479 AbstractCegarLoop]: Abstraction has 584 states and 1777 transitions. [2020-10-05 23:30:29,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:30:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1777 transitions. [2020-10-05 23:30:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:30:29,325 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:29,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:29,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:30:29,325 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:29,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:29,326 INFO L82 PathProgramCache]: Analyzing trace with hash -696654604, now seen corresponding path program 1 times [2020-10-05 23:30:29,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:29,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032147771] [2020-10-05 23:30:29,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:29,425 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-05 23:30:29,425 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032147771] [2020-10-05 23:30:29,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:29,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:29,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752570232] [2020-10-05 23:30:29,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:30:29,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:29,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:30:29,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:29,427 INFO L87 Difference]: Start difference. First operand 584 states and 1777 transitions. Second operand 5 states. [2020-10-05 23:30:29,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:29,513 INFO L93 Difference]: Finished difference Result 650 states and 1964 transitions. [2020-10-05 23:30:29,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:30:29,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 23:30:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:29,520 INFO L225 Difference]: With dead ends: 650 [2020-10-05 23:30:29,520 INFO L226 Difference]: Without dead ends: 650 [2020-10-05 23:30:29,520 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:29,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-10-05 23:30:29,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 638. [2020-10-05 23:30:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2020-10-05 23:30:29,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1936 transitions. [2020-10-05 23:30:29,542 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1936 transitions. Word has length 14 [2020-10-05 23:30:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:29,542 INFO L479 AbstractCegarLoop]: Abstraction has 638 states and 1936 transitions. [2020-10-05 23:30:29,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:30:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1936 transitions. [2020-10-05 23:30:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:30:29,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:29,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:29,544 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:30:29,544 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:29,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:29,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1576427536, now seen corresponding path program 1 times [2020-10-05 23:30:29,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:29,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071376860] [2020-10-05 23:30:29,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:29,639 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-05 23:30:29,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071376860] [2020-10-05 23:30:29,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:29,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:29,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451945719] [2020-10-05 23:30:29,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:30:29,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:29,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:30:29,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:30:29,641 INFO L87 Difference]: Start difference. First operand 638 states and 1936 transitions. Second operand 4 states. [2020-10-05 23:30:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:29,676 INFO L93 Difference]: Finished difference Result 606 states and 1632 transitions. [2020-10-05 23:30:29,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:30:29,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-05 23:30:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:29,681 INFO L225 Difference]: With dead ends: 606 [2020-10-05 23:30:29,681 INFO L226 Difference]: Without dead ends: 438 [2020-10-05 23:30:29,681 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:29,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-10-05 23:30:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2020-10-05 23:30:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-10-05 23:30:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1136 transitions. [2020-10-05 23:30:29,695 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1136 transitions. Word has length 14 [2020-10-05 23:30:29,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:29,695 INFO L479 AbstractCegarLoop]: Abstraction has 438 states and 1136 transitions. [2020-10-05 23:30:29,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:30:29,696 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1136 transitions. [2020-10-05 23:30:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:30:29,697 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:29,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:29,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:30:29,697 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:29,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:29,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1045632414, now seen corresponding path program 1 times [2020-10-05 23:30:29,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:29,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425292314] [2020-10-05 23:30:29,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:29,794 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-05 23:30:29,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425292314] [2020-10-05 23:30:29,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:29,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:30:29,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198868419] [2020-10-05 23:30:29,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:30:29,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:29,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:30:29,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:29,797 INFO L87 Difference]: Start difference. First operand 438 states and 1136 transitions. Second operand 5 states. [2020-10-05 23:30:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:29,849 INFO L93 Difference]: Finished difference Result 355 states and 856 transitions. [2020-10-05 23:30:29,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:30:29,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-05 23:30:29,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:29,853 INFO L225 Difference]: With dead ends: 355 [2020-10-05 23:30:29,853 INFO L226 Difference]: Without dead ends: 275 [2020-10-05 23:30:29,854 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-10-05 23:30:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 257. [2020-10-05 23:30:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-10-05 23:30:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 602 transitions. [2020-10-05 23:30:29,862 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 602 transitions. Word has length 15 [2020-10-05 23:30:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:29,863 INFO L479 AbstractCegarLoop]: Abstraction has 257 states and 602 transitions. [2020-10-05 23:30:29,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:30:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 602 transitions. [2020-10-05 23:30:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:30:29,864 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:29,864 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:29,864 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:30:29,864 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:29,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:29,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1674269273, now seen corresponding path program 1 times [2020-10-05 23:30:29,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:29,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236630202] [2020-10-05 23:30:29,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:30,001 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-05 23:30:30,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236630202] [2020-10-05 23:30:30,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:30,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:30:30,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684298785] [2020-10-05 23:30:30,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:30:30,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:30,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:30:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:30,003 INFO L87 Difference]: Start difference. First operand 257 states and 602 transitions. Second operand 6 states. [2020-10-05 23:30:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:30,056 INFO L93 Difference]: Finished difference Result 234 states and 554 transitions. [2020-10-05 23:30:30,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:30:30,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-05 23:30:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:30,058 INFO L225 Difference]: With dead ends: 234 [2020-10-05 23:30:30,058 INFO L226 Difference]: Without dead ends: 219 [2020-10-05 23:30:30,059 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:30:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-10-05 23:30:30,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2020-10-05 23:30:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-10-05 23:30:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 518 transitions. [2020-10-05 23:30:30,065 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 518 transitions. Word has length 18 [2020-10-05 23:30:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:30,065 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 518 transitions. [2020-10-05 23:30:30,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:30:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 518 transitions. [2020-10-05 23:30:30,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:30:30,066 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:30,066 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:30,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:30:30,067 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:30,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:30,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1260558533, now seen corresponding path program 1 times [2020-10-05 23:30:30,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:30,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499814551] [2020-10-05 23:30:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:30,140 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-05 23:30:30,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499814551] [2020-10-05 23:30:30,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:30,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:30:30,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191170358] [2020-10-05 23:30:30,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:30:30,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:30,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:30:30,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:30,142 INFO L87 Difference]: Start difference. First operand 215 states and 518 transitions. Second operand 6 states. [2020-10-05 23:30:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:30,267 INFO L93 Difference]: Finished difference Result 396 states and 931 transitions. [2020-10-05 23:30:30,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:30:30,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-05 23:30:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:30,270 INFO L225 Difference]: With dead ends: 396 [2020-10-05 23:30:30,270 INFO L226 Difference]: Without dead ends: 266 [2020-10-05 23:30:30,270 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:30:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-10-05 23:30:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 215. [2020-10-05 23:30:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-10-05 23:30:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 498 transitions. [2020-10-05 23:30:30,278 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 498 transitions. Word has length 22 [2020-10-05 23:30:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:30,278 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 498 transitions. [2020-10-05 23:30:30,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:30:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 498 transitions. [2020-10-05 23:30:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:30:30,279 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:30,279 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:30,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:30:30,280 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:30,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:30,280 INFO L82 PathProgramCache]: Analyzing trace with hash -327632581, now seen corresponding path program 2 times [2020-10-05 23:30:30,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:30,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384440913] [2020-10-05 23:30:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:30,330 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-05 23:30:30,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384440913] [2020-10-05 23:30:30,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:30,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:30,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759914806] [2020-10-05 23:30:30,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:30:30,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:30,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:30:30,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:30:30,333 INFO L87 Difference]: Start difference. First operand 215 states and 498 transitions. Second operand 4 states. [2020-10-05 23:30:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:30,353 INFO L93 Difference]: Finished difference Result 292 states and 670 transitions. [2020-10-05 23:30:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:30:30,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-05 23:30:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:30,355 INFO L225 Difference]: With dead ends: 292 [2020-10-05 23:30:30,355 INFO L226 Difference]: Without dead ends: 145 [2020-10-05 23:30:30,355 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-05 23:30:30,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-10-05 23:30:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-10-05 23:30:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 330 transitions. [2020-10-05 23:30:30,359 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 330 transitions. Word has length 22 [2020-10-05 23:30:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:30,360 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 330 transitions. [2020-10-05 23:30:30,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:30:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 330 transitions. [2020-10-05 23:30:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:30:30,361 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:30,361 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:30,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:30:30,361 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:30,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:30,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1580908181, now seen corresponding path program 3 times [2020-10-05 23:30:30,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:30,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001211337] [2020-10-05 23:30:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:30,465 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-05 23:30:30,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001211337] [2020-10-05 23:30:30,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:30,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:30:30,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754076336] [2020-10-05 23:30:30,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:30:30,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:30,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:30:30,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:30,471 INFO L87 Difference]: Start difference. First operand 145 states and 330 transitions. Second operand 6 states. [2020-10-05 23:30:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:30,558 INFO L93 Difference]: Finished difference Result 183 states and 407 transitions. [2020-10-05 23:30:30,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:30:30,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-05 23:30:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:30,560 INFO L225 Difference]: With dead ends: 183 [2020-10-05 23:30:30,560 INFO L226 Difference]: Without dead ends: 73 [2020-10-05 23:30:30,560 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:30:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-05 23:30:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-10-05 23:30:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-05 23:30:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 138 transitions. [2020-10-05 23:30:30,563 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 138 transitions. Word has length 22 [2020-10-05 23:30:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:30,564 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 138 transitions. [2020-10-05 23:30:30,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:30:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 138 transitions. [2020-10-05 23:30:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:30:30,565 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:30,565 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:30,565 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:30:30,565 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:30,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1989134203, now seen corresponding path program 4 times [2020-10-05 23:30:30,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:30,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557827495] [2020-10-05 23:30:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:30,904 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-05 23:30:30,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557827495] [2020-10-05 23:30:30,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:30,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:30:30,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560976605] [2020-10-05 23:30:30,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:30:30,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:30,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:30:30,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:30:30,907 INFO L87 Difference]: Start difference. First operand 73 states and 138 transitions. Second operand 8 states. [2020-10-05 23:30:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:31,076 INFO L93 Difference]: Finished difference Result 99 states and 186 transitions. [2020-10-05 23:30:31,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:30:31,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-05 23:30:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:31,078 INFO L225 Difference]: With dead ends: 99 [2020-10-05 23:30:31,078 INFO L226 Difference]: Without dead ends: 53 [2020-10-05 23:30:31,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:30:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-05 23:30:31,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-10-05 23:30:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-05 23:30:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2020-10-05 23:30:31,081 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 22 [2020-10-05 23:30:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:31,081 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2020-10-05 23:30:31,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:30:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2020-10-05 23:30:31,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:30:31,082 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:31,082 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:31,082 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:30:31,082 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:31,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:31,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1873285447, now seen corresponding path program 5 times [2020-10-05 23:30:31,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:31,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58899260] [2020-10-05 23:30:31,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:30:31,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:30:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:30:31,172 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:30:31,208 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:30:31,208 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:30:31,209 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:30:31,210 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:30:31,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L2-->L830: Formula: (let ((.cse6 (= 0 (mod ~x$w_buff1_used~0_In1095124371 256))) (.cse7 (= (mod ~x$r_buff1_thd0~0_In1095124371 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In1095124371 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In1095124371 256) 0))) (let ((.cse3 (not .cse8)) (.cse4 (not .cse9)) (.cse5 (or .cse8 .cse9)) (.cse1 (not .cse7)) (.cse2 (not .cse6)) (.cse0 (or .cse6 .cse7))) (and (or (and (= ~x$w_buff1_used~0_In1095124371 ~x$w_buff1_used~0_Out1095124371) .cse0) (and (= ~x$w_buff1_used~0_Out1095124371 0) .cse1 .cse2)) (= ~x$r_buff0_thd0~0_Out1095124371 ~x$r_buff0_thd0~0_In1095124371) (or (and .cse3 (= ~x$w_buff0_used~0_Out1095124371 0) .cse4) (and .cse5 (= ~x$w_buff0_used~0_In1095124371 ~x$w_buff0_used~0_Out1095124371))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1095124371 0)) (or (and (= ~x~0_Out1095124371 ~x$w_buff0~0_In1095124371) .cse3 .cse4) (and .cse5 (or (and .cse1 (= ~x~0_Out1095124371 ~x$w_buff1~0_In1095124371) .cse2) (and (= ~x~0_In1095124371 ~x~0_Out1095124371) .cse0)))) (= ~x$r_buff1_thd0~0_Out1095124371 ~x$r_buff1_thd0~0_In1095124371) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1095124371 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1095124371|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1095124371, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1095124371, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1095124371|, ~x$w_buff1~0=~x$w_buff1~0_In1095124371, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1095124371, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1095124371, ~x~0=~x~0_In1095124371, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1095124371} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1095124371, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1095124371, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1095124371|, ~x$w_buff1~0=~x$w_buff1~0_In1095124371, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1095124371|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1095124371, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1095124371|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1095124371|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1095124371|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1095124371, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1095124371, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1095124371|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1095124371|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1095124371, ~x~0=~x~0_Out1095124371} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-05 23:30:31,227 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,228 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,228 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,229 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,229 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,229 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,230 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,230 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,230 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,231 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,231 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,231 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,231 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,231 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,231 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,232 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,232 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,232 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,232 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,233 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,233 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,233 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,234 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,234 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,234 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,234 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,235 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,235 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,236 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,236 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,236 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,237 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,237 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,237 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:30:31,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:31,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:30:31 BasicIcfg [2020-10-05 23:30:31,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:30:31,307 INFO L168 Benchmark]: Toolchain (without parser) took 14082.17 ms. Allocated memory was 141.0 MB in the beginning and 364.4 MB in the end (delta: 223.3 MB). Free memory was 102.3 MB in the beginning and 199.7 MB in the end (delta: -97.5 MB). Peak memory consumption was 125.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:31,308 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 23:30:31,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.95 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 156.6 MB in the end (delta: -54.7 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:31,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.17 ms. Allocated memory is still 205.0 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:31,310 INFO L168 Benchmark]: Boogie Preprocessor took 46.97 ms. Allocated memory is still 205.0 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:31,311 INFO L168 Benchmark]: RCFGBuilder took 2091.48 ms. Allocated memory was 205.0 MB in the beginning and 248.5 MB in the end (delta: 43.5 MB). Free memory was 150.6 MB in the beginning and 167.6 MB in the end (delta: -17.0 MB). Peak memory consumption was 98.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:31,312 INFO L168 Benchmark]: TraceAbstraction took 11141.53 ms. Allocated memory was 248.5 MB in the beginning and 364.4 MB in the end (delta: 115.9 MB). Free memory was 167.6 MB in the beginning and 199.7 MB in the end (delta: -32.1 MB). Peak memory consumption was 83.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:31,315 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.22 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 724.95 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 156.6 MB in the end (delta: -54.7 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.17 ms. Allocated memory is still 205.0 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.97 ms. Allocated memory is still 205.0 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2091.48 ms. Allocated memory was 205.0 MB in the beginning and 248.5 MB in the end (delta: 43.5 MB). Free memory was 150.6 MB in the beginning and 167.6 MB in the end (delta: -17.0 MB). Peak memory consumption was 98.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11141.53 ms. Allocated memory was 248.5 MB in the beginning and 364.4 MB in the end (delta: 115.9 MB). Free memory was 167.6 MB in the beginning and 199.7 MB in the end (delta: -32.1 MB). Peak memory consumption was 83.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.2s, 103 ProgramPointsBefore, 37 ProgramPointsAfterwards, 95 TransitionsBefore, 27 TransitionsAfterwards, 1724 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 857 VarBasedMoverChecksPositive, 41 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5143 CheckedPairsTotal, 77 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L704] 0 int __unbuffered_p2_EBX = 0; [L705] 0 _Bool main$tmp_guard0; [L706] 0 _Bool main$tmp_guard1; [L708] 0 int x = 0; [L709] 0 _Bool x$flush_delayed; [L710] 0 int x$mem_tmp; [L711] 0 _Bool x$r_buff0_thd0; [L712] 0 _Bool x$r_buff0_thd1; [L713] 0 _Bool x$r_buff0_thd2; [L714] 0 _Bool x$r_buff0_thd3; [L715] 0 _Bool x$r_buff1_thd0; [L716] 0 _Bool x$r_buff1_thd1; [L717] 0 _Bool x$r_buff1_thd2; [L718] 0 _Bool x$r_buff1_thd3; [L719] 0 _Bool x$read_delayed; [L720] 0 int *x$read_delayed_var; [L721] 0 int x$w_buff0; [L722] 0 _Bool x$w_buff0_used; [L723] 0 int x$w_buff1; [L724] 0 _Bool x$w_buff1_used; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L814] 0 pthread_t t515; [L815] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L816] 0 pthread_t t516; [L817] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] 0 pthread_t t517; [L819] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L763] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L786] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L734] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L773] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L792] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L792] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L793] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L793] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L794] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L794] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L795] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L795] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L796] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L833] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L834] 0 x$flush_delayed = weak$$choice2 [L835] 0 x$mem_tmp = x [L836] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L836] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L837] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L837] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L838] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L838] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L838] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L838] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L838] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L839] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L839] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L840] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L840] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L841] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L842] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L844] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L844] 0 x = x$flush_delayed ? x$mem_tmp : x [L845] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 359 SDtfs, 388 SDslu, 566 SDs, 0 SdLazy, 348 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=972occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 101 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 24740 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...